249 search results - page 36 / 50 » Principals in Programming Languages: A Syntactic Proof Techn... |
AOSD
2012
ACM
12 years 4 months ago
2012
ACM
In this work we consider specification and compositional verification for interference detection when several aspects are woven together under joint-weaving semantics without re...
POPL
2011
ACM
12 years 11 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
POPL
2008
ACM
14 years 9 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
DRM
2007
Springer
14 years 2 months ago
2007
Springer
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
NMR
2004
Springer
14 years 2 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...