Sciweavers

4502 search results - page 18 / 901
» Regular Model Checking
Sort
View
199
Voted
CONCUR
2011
Springer
14 years 8 days ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon
FOSSACS
2007
Springer
15 years 6 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
75
Voted
SMI
2006
IEEE
15 years 6 months ago
Regular Mesh Construction Algorithms using Regular Handles
This paper presents our recent theoretical results on high genus modeling. We introduce a new concept called regular handles. Using regular handles it is possible to increase genu...
Ergun Akleman, Jianer Chen
PLANX
2008
15 years 1 months ago
Linear Time Membership for a Class of XML Types with Interleaving and Counting
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
101
Voted
CAV
2003
Springer
153views Hardware» more  CAV 2003»
15 years 5 months ago
Interpolation and SAT-Based Model Checking
Abstract. We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circ...
Kenneth L. McMillan