3994 search results - page 603 / 799 » A Linear Logical Framework |
184
click to vote
TOCL
2011
15 years 2 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...
221
Voted
VSTTE
2012
Springer
14 years 2 months ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
244
click to vote
SIGSOFT
2007
ACM
16 years 7 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
206
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
During a lifecycle of a large-scale Web application, Web developers produce a wide variety of inter-related Web objects. Following good Web engineering practice, developers often ...
341
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...