Sciweavers

52 search results - page 3 / 11
» The Verus Language: Representing Time Efficiently with BDDs
Sort
View
SAC
2006
ACM
13 years 8 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
IPL
2008
79views more  IPL 2008»
13 years 8 months ago
On the efficient construction of quasi-reversible automata for reversible languages
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...
Pedro García, Manuel Vazquez de Parga, Dami...
ICSE
2004
IEEE-ACM
14 years 8 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
PODS
2005
ACM
136views Database» more  PODS 2005»
14 years 8 months ago
Context-sensitive program analysis as database queries
Program analysis has been increasingly used in software engineering tasks such as auditing programs for security vulnerabilities and finding errors in general. Such tools often re...
Monica S. Lam, John Whaley, V. Benjamin Livshits, ...
DAC
2005
ACM
14 years 9 months ago
Towards scalable flow and context sensitive pointer analysis
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
Jianwen Zhu