499 search results - page 44 / 100 » Logic Programming in a Fragment of Intuitionistic Linear Log... |
236
click to vote
CONCUR
2011
Springer
14 years 4 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
134
click to vote
TLCA
2009
Springer
15 years 11 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
125
click to vote
ECRTS
1999
IEEE
15 years 8 months ago
1999
IEEE
We give timed automaton models for a class of Programmable Logic Controller (PLC) applications, that are programmed in a simple fragment of the language Instruction Lists as defin...
144
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
147
click to vote
TOCL
2011
14 years 11 months ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...