209 search results - page 36 / 42 » An executable formal semantics of C with applications |
CAV
2009
Springer
14 years 9 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
PLDI
2006
ACM
14 years 2 months ago
2006
ACM
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We discuss the problem of building a compiler which can lift in a provably correct way pieces of information on the execution cost of the object code to cost annotations on the so...
TODAES
1998
13 years 8 months ago
1998
Abstract State Machines (ASMs) provide a sound mathematical basis for the specification and verification of systems. An application of the ASM methodology to the verification of a ...
APLAS
2005
ACM
14 years 2 months ago
2005
ACM
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...