the main goal of this research is to study, through the minimalist program, the mechanism of checking phi(φ)-features (person & number) and nominative case in persian sentences. different syntactic structures are examined in this paper. it is shown that verb raising is overt in persian and that the uninterpretable φ-features of the finite tense head are valued & checked by the interpretable φ-f...

Model-checking is a popular technique for verifying finite-state concurrent systems, the behaviour of which can be modeled using Labeled Transition Systems (Ltss). In this report, we study the model-checking problem for the modal μ-calculus on acyclic Ltss. This has various applications of practical interest such as trace analysis, log information auditing, run-time monitoring, etc. We show tha...

Symbolic model checking has been found extremely efficient in the verification of hardware designs, and has been widely adopted in industry in recent years. While traditional model checkers ([McM93]) used the temporal logics ctl or ltl as their specification language, contemporary industrial languages, have sought ways to make the specification language easier to learn and use. The temporal lan...

For every finite model M and an LTL property φ, there exists a number CT (the Completeness Threshold) such that if there is no counterexample to φ in M of length CT or less, then M |= φ. Finding this number, if it is sufficiently small, offers a practical method for making Bounded Model Checking complete. We describe how to compute an over-approximation to CT for a general LTL property using Bü...

In this paper, we present a tool named GOAL (an acronym derived from “Graphical Tool for OmegaAutomata and Logics”) whose main functions include (1) drawing and testing Büchi automata, (2) checking the language equivalence between two Büchi automata, (3) translating quantified propositional linear temporal logic (QPTL) formulae into equivalent Büchi automata, and (4) exporting Büchi automata as...

We define memory-efficient certificates for μ-calculus model checking problems based on the well-known correspondence of the μ-calculus model checking with winning certain parity games. Winning strategies can independently checked, in low polynomial time, by observing that there is no reachable strongly connected component in the graph of the parity game whose largest priority is odd. Winning s...

This paper helps to bridge the gap between (i) the use of logic for specifying program semantics and performing program analysis, and (ii) abstract interpretation. Many operations needed by an abstract interpreter can be reduced to the problem of symbolic abstraction: the symbolic abstraction of a formula φ in logic L, denoted by α̂(φ), is the most-precise value in abstract domain A that over-ap...

A new diagnostic that is useful for checking the algorithmic correctness of Monte Carlo computer programs is presented. The check is made by comparing the Boltzmann temperature, which is input to the program and used to accept or reject moves, with a configurational temperature k T B config = ∇ ∇ q q Φ Φ 2 2 . Here, Φ is the potential energy of the system and ∇q represents the dimensionless gra...

We propose extending Alternating-time Temporal Logic (ATL) by an operator 〈i ⊑ Γ〉φ to express that i can distribute its powers to a set of sub-agents Γ in a way which satisfies ATL condition φ on the strategic ability of the coalitions they may form, possibly together with others agents. We prove the decidability of model-checking of formulas whose 〈. ⊑ .〉-subformulas have the form 〈i1 ⊑ Γ1〉 . ...