Sciweavers

138 search results - page 23 / 28
» Model Checking Round-Based Distributed Algorithms
Sort
View
KBSE
2010
IEEE
14 years 7 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
CONCUR
2006
Springer
15 years 1 months ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
DEDS
2007
104views more  DEDS 2007»
14 years 9 months ago
Trellis Processes : A Compact Representation for Runs of Concurrent Systems
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
Eric Fabre
SIGSOFT
2003
ACM
15 years 10 months ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...
81
Voted
HT
2004
ACM
15 years 2 months ago
Hypertext versioning for embedded link models
In this paper, we describe Chrysant, a hypertext version control system for embedded link models. Chrysant provides generalpurpose versioning capability to hypertext systems with ...
Kai Pan, E. James Whitehead Jr., Guozheng Ge