Sciweavers

125 search results - page 3 / 25
» A Logic of Probability with Decidable Model Checking
Sort
View
FSTTCS
2004
Springer
14 years 24 days ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
EUROGP
2007
Springer
116views Optimization» more  EUROGP 2007»
14 years 1 months ago
Genetic Programming with Fitness Based on Model Checking
Abstract. Model checking is a way of analysing programs and programlike structures to decide whether they satisfy a list of temporal logic statements describing desired behaviour. ...
Colin G. Johnson
ENTCS
2002
91views more  ENTCS 2002»
13 years 7 months ago
Interval Duration Logic: Expressiveness and Decidability
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Du...
Paritosh K. Pandya
FSTTCS
2000
Springer
13 years 11 months ago
Model Checking CTL Properties of Pushdown Systems
: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide ...
Igor Walukiewicz
ATAL
2010
Springer
13 years 8 months ago
Strategic planning for probabilistic games with incomplete information
Alternating-time Temporal Logic (ATL) [1] is used to reason about strategic abilities of agents. Aiming at strategies that can realistically be implemented in software, many varia...
Henning Schnoor