899 search results - page 110 / 180 » A CTL-Based Logic for Program Abstractions |
117
click to vote
PPDP
2007
Springer
15 years 10 months ago
2007
Springer
We propose a framework to construct web-oriented user interfaces in a high-level way by exploiting declarative programming techniques. Such user interfaces are intended to manipul...
125
click to vote
LISP
2008
15 years 4 months ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
156
Voted
APLAS
2010
ACM
15 years 4 months ago
2010
ACM
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
152
click to vote
ISSTA
2010
ACM
15 years 6 months ago
2010
ACM
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
135
Voted
EMSOFT
2001
Springer
15 years 8 months ago
2001
Springer
rovides an abstract programmer’s model for the implementation of embedded control systems with hard real-time constraints. A typical control application consists of periodic soft...