Sciweavers

286 search results - page 48 / 58
» Agile Formality: A Mole of Software Engineering Practices
Sort
View
C3S2E
2010
ACM
13 years 8 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
ICFEM
2010
Springer
13 years 6 months ago
A Modular Scheme for Deadlock Prevention in an Object-Oriented Programming Model
Despite the advancements of concurrency theory in the past decades, practical concurrent programming has remained a challenging activity. Fundamental problems such as data races an...
Scott West, Sebastian Nanz, Bertrand Meyer
DAC
2006
ACM
14 years 8 months ago
Efficient simulation of critical synchronous dataflow graphs
Simulation and verification using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems. The synchronous dat...
Chia-Jui Hsu, José Luis Pino, Ming-Yung Ko,...
SIGSOFT
2008
ACM
14 years 8 months ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su
POPL
2008
ACM
14 years 8 months ago
Proving non-termination
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumda...