Sciweavers

200 search results - page 11 / 40
» Symbolic Equivalences for Open Systems
Sort
View
SIGSOFT
2003
ACM
14 years 8 months ago
ARCHER: using symbolic, path-sensitive analysis to detect memory access errors
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
Yichen Xie, Andy Chou, Dawson R. Engler
ACMICEC
2007
ACM
127views ECommerce» more  ACMICEC 2007»
13 years 11 months ago
Symbolic model checking of institutions
Norms defined by institutions and enforced by organizations have been put forward as a mechanism to increase the efficiency and reliability of electronic transactions carried out ...
Francesco Viganò, Marco Colombetti
ENTCS
2006
141views more  ENTCS 2006»
13 years 7 months ago
Refining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
Mojmír Kretínský, Vojtech Reh...
APN
2010
Springer
14 years 13 days ago
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
Thomas Chatain, Eric Fabre
ICSE
2012
IEEE-ACM
11 years 10 months ago
make test-zesti: A symbolic execution solution for improving regression testing
Abstract—Software testing is an expensive and time consuming process, often involving the manual creation of comprehensive regression test suites. However, current testing method...
Paul Dan Marinescu, Cristian Cadar