Sciweavers

115 search results - page 3 / 23
» Verifying Probabilistic Procedural Programs
Sort
View
ICSE
2012
IEEE-ACM
11 years 10 months ago
Engineering and verifying requirements for programmable self-assembling nanomachines
—We propose an extension of van Lamsweerde’s goal-oriented requirements engineering to the domain of programmable DNA nanotechnology. This is a domain in which individual devic...
Robyn R. Lutz, Jack H. Lutz, James I. Lathrop, Tit...
ATMOS
2009
102views Optimization» more  ATMOS 2009»
13 years 9 months ago
An Improved Train Classification Procedure for the Hump Yard Lausanne Triage
In this paper we combine an integer programming approach and a computer simulation tool to successfully develop and verify an improved classification schedule for a real-world trai...
Peter Marton, Jens Maue, Marc Nunkesser
VMCAI
2004
Springer
14 years 1 months ago
Approximate Probabilistic Model Checking
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
Thomas Hérault, Richard Lassaigne, Fr&eacut...
MP
2006
78views more  MP 2006»
13 years 8 months ago
Valid inequalities based on the interpolation procedure
We study the interpolation procedure of Gomory and Johnson (1972), which generates cutting planes for general integer programs from facets of cyclic group polyhedra. This idea has...
Sanjeeb Dash, Oktay Günlük
POPL
2008
ACM
14 years 8 months ago
Generating precise and concise procedure summaries
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
Greta Yorsh, Eran Yahav, Satish Chandra