632 search results - page 111 / 127 » Combining programming with theorem proving |
CHARME
2001
Springer
14 years 8 days ago
2001
Springer
Formal analysis remains outside the mainstream of system design practice. Interactive methods and tools are regarded by some to be on the margin of useful research in this area. Al...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
Example Guided Abstraction Refinement (CEGAR) [6] framework. A number of wellengineered software model-checkers are available, e.g., SLAM [1] and BLAST [12]. Why build another one?...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...