Sciweavers

322 search results - page 28 / 65
» Developing and Reasoning About Probabilistic Programs in pGC...
Sort
View
MFCS
1994
Springer
13 years 11 months ago
A Proof System for Asynchronously Communicating Deterministic Processes
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope wi...
Frank S. de Boer, M. van Hulst
ENTCS
2002
97views more  ENTCS 2002»
13 years 7 months ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott
CSMR
1998
IEEE
13 years 12 months ago
Towards Mature Measurement Programs
Many organizations are using measurement as a means to improve their software development and maintenance processes. A reasonable consensus has been reached about the main success...
Frank Niessink, Hans van Vliet
PLDI
2011
ACM
12 years 10 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
CAV
2010
Springer
214views Hardware» more  CAV 2010»
13 years 11 months ago
Comfusy: A Tool for Complete Functional Synthesis
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. We present Comfusy, a tool that extends the compiler for the gener...
Viktor Kuncak, Mikaël Mayer, Ruzica Piskac, P...