Sciweavers

227 search results - page 14 / 46
» Bounded Model Checking of Concurrent Programs
Sort
View
NFM
2011
242views Formal Methods» more  NFM 2011»
14 years 4 months ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler
77
Voted
LATIN
2010
Springer
15 years 4 months ago
The Language Theory of Bounded Context-Switching
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
76
Voted
PLDI
2009
ACM
15 years 2 months ago
Progress guarantee for parallel programs via bounded lock-freedom
Parallel platforms are becoming ubiquitous with modern computing systems. Many parallel applications attempt to avoid locks in order to achieve high responsiveness, aid scalabilit...
Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaa...
CLUSTER
2000
IEEE
15 years 2 months ago
A Concurrent Programming Environment with Support for Distributed Computations and Code Mobility
We propose a programming model for distributed concurrent systems with mobile objects in the context of a process calculus. Code mobility is induced by lexical scoping on names. O...
Luís M. B. Lopes, Álvaro Reis Figuei...
CORR
2011
Springer
176views Education» more  CORR 2011»
14 years 4 months ago
Quantitative Synthesis for Concurrent Programs
nt programs, programming abstractions for data parallel programs, software model checking for confidentiality, electronic voting security, synthesis of interface specons for Java ...
Pavol Cerný, Krishnendu Chatterjee, Thomas ...