74 search results - page 12 / 15 » Program verification using templates over predicate abstract... |
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
APLAS
2004
ACM
14 years 25 days ago
2004
ACM
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas eļ¬ciently. The design choices however eļ...
POPL
2005
ACM
14 years 7 months ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
SAS
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly inļ¬nite, trees have much appeal in that rational trees allow for faster uniļ¬cation (due to the omission of t...
GPCE
2004
Springer
14 years 23 days ago
2004
Springer
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and deļ¬nitions, thus abstracting ove...