Search Results - "2009 24th Annual IEEE Symposium on Logic In Computer Science"

A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes by Kobayashi, N., Ong, C.-H.L.

“…The model checking of higher-order recursion schemes has important applications in the verification of higher-order programs. Ong has previously shown that the…”
Get full text

Logics with Rank Operators by Dawar, A., Grohe, M., Holm, B., Laubner, B.

“…We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are…”
Get full text

Logical Step-Indexed Logical Relations by Dreyer, D., Ahmed, A., Birkedal, L.

“…We show how to reason about "step-indexed" logical relations in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic…”
Get full text

An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it by Friedmann, O.

“…This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to Voege and Jurdzinski. First, we…”
Get full text

Expressiveness and Closure Properties for Quantitative Languages by Chatterjee, K., Doyen, L., Henzinger, T.A.

“…Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a…”
Get full text

The General Vector Addition System Reachability Problem by Presburger Inductive Invariants by Leroux, J.

“…The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms…”
Get full text

Indexed Containers by Altenkirch, T., Morris, P.

“…We show that the syntactically rich notion of inductive families can be reduced to a core type theory with a fixed number of type constructors exploiting the…”
Get full text

Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications by Taolue Chen, Tingting Han, Katoen, J.-P., Mereacre, A.

“…We study the following problem: given a continuous-time Markov chain (CTMC) C, and a linear real-time property provided as a deterministic timed automaton…”
Get full text

Psi-calculi: Mobile Processes, Nominal Data, and Logic by Bengtson, J., Johansson, M., Parrow, J., Victor, B.

“…A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These…”
Get full text

On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations by Kieronski, E., Tendera, L.

“…We show that every finitely satisfiable two-variable first-order formula with two equivalence relations has a model of size at most triply exponential with…”
Get full text

Qualitative Determinacy and Decidability of Stochastic Games with Signals by Bertrand, N., Genest, B., Gimbert, H.

“…We consider the standard model of finite two person zero sum stochastic games with signals. We are interested in the existence of almost surely winning or…”
Get full text

Applications of Game Semantics: From Program Analysis to Hardware Synthesis by Ghica, D.R.

“…After informally reviewing the main concepts from game semantics and placing the development of the field in a historical context we examine its main…”
Get full text

On the Computational Complexity of Verifying One-Counter Processes by Goller, S., Mayr, R., To, A.W.

“…One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related…”
Get full text

An Algebra for Kripke Polynomial Coalgebras by Bonsangue, M., Rutten, J., Silva, A.

“…Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial…”
Get full text

My 27-year Quest to Overcome the State Explosion Problem by Clarke, E.M.

“…Model checking is an automatic verification technique for state-transition systems that are finite-state or that have finite-state abstractions. In the early…”
Get full text

Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks by Kahlon, V.

“…The problem of pairwise CFL-reachability is to decide whether two given program locations in different threads are simultaneously reachable in the presence of…”
Get full text

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics by Kazakov, Y., Pratt-Hartmann, I.

“…Graded modal logic is the formal language obtained from ordinary modal logic by endowing its modal operators with cardinality constraints. Under the familiar…”
Get full text

Winning Concurrent Reachability Games Requires Doubly-Exponential Patience by Hansen, K.A., Koucky, M., Miltersen, P.B.

“…We exhibit a deterministic concurrent reachability game PURGATORY n with n non-terminal positions and a binary choice for both players in every position so…”
Get full text

Substructural Operational Semantics as Ordered Logic Programming by Pfenning, F., Simmons, R.J.

“…We describe a substructural logic with ordered, linear, and persistent propositions and then endow a fragment with a committed choice forward-chaining…”
Get full text

Graded Computation Tree Logic by Bianco, A., Mogavero, F., Murano, A.

“…In modal logics, graded (world) modalities have been deeply investigated as a useful framework for generalizing standard existential and universal modalities…”
Get full text