Sciweavers

1356 search results - page 103 / 272
» The ideal of verified software
Sort
View
SIGSOFT
2009
ACM
16 years 19 days ago
Symbolic pruning of concurrent program executions
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
Chao Wang, Swarat Chaudhuri, Aarti Gupta, Yu Yang
KBSE
2007
IEEE
15 years 6 months ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
ISSTA
2006
ACM
15 years 5 months ago
Breaking up is hard to do: an investigation of decomposition for assume-guarantee reasoning
Finite-state verification techniques are often hampered by the stateexplosion problem. One proposed approach for addressing this problem is assume-guarantee reasoning. Using rece...
Jamieson M. Cobleigh, George S. Avrunin, Lori A. C...
SEFM
2005
IEEE
15 years 5 months ago
Precise Analysis of Memory Consumption using Program Logics
Memory consumption policies provide a means to control resource usage on constrained devices, and play an important role in ensuring the overall quality of software systems, and i...
Gilles Barthe, Mariela Pavlova, Gerardo Schneider
IEE
2008
115views more  IEE 2008»
14 years 12 months ago
Faithful mapping of model classes to mathematical structures
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
Ádám Darvas, Peter Müller