Sciweavers

194 search results - page 30 / 39
» Program model checking as a new trend
Sort
View
ACSD
2001
IEEE
134views Hardware» more  ACSD 2001»
15 years 1 months ago
Embedding Imperative Synchronous Languages in Interactive Theorem Provers
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
Klaus Schneider
NOMS
2010
IEEE
180views Communications» more  NOMS 2010»
14 years 8 months ago
Performance-driven task co-scheduling for MapReduce environments
—MapReduce is a data-driven programming model proposed by Google in 2004 which is especially well suited for distributed data analytics applications. We consider the management o...
Jorda Polo, David Carrera, Yolanda Becerra, Malgor...
SIGSOFT
2003
ACM
15 years 10 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
14 years 10 months ago
Searching for liveness property violations in concurrent systems with ACO
Liveness properties in concurrent systems are, informally, those properties that stipulate that something good eventually happens during execution. In order to prove that a given ...
Enrique Alba, J. Francisco Chicano
80
Voted
VMCAI
2009
Springer
15 years 4 months ago
Finding Concurrency-Related Bugs Using Random Isolation
This paper describes the methods used in Empire, a tool to detect concurrency-related bugs, namely atomic-set serializability violations in Java programs. The correctness criterion...
Nicholas Kidd, Thomas W. Reps, Julian Dolby, Manda...