2573 search results - page 278 / 515 » Combinations of Modal Logics |
217
click to vote
PLDI
2011
ACM
14 years 9 months ago
2011
ACM
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
159
click to vote
VMCAI
2009
Springer
16 years 1 months ago
2009
Springer
—A variety of partial modeling formalisms, aimed re and reason about abstractions, have been proposed. Some, e.g., Kripke Modal Transition Systems (KMTSs) put strong restrictions...
193
click to vote
TIME
2009
IEEE
16 years 1 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
185
click to vote
BPM
2007
Springer
16 years 25 days ago
2007
Springer
Business process design is primarily driven by process improvement objectives. However, the role of control objectives stemming from regulations and standards is becoming increasin...
194
click to vote
ICALP
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...