Sciweavers

238 search results - page 13 / 48
» Constraint Solving and Symbolic Execution
Sort
View
85
Voted
JFP
2008
97views more  JFP 2008»
14 years 9 months ago
HM(X) type inference is CLP(X) solving
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
Martin Sulzmann, Peter J. Stuckey
75
Voted
ASPDAC
2000
ACM
97views Hardware» more  ASPDAC 2000»
15 years 3 months ago
Symbolic debugging of globally optimized behavioral specifications
Symbolic debuggers are system development tools that can accelerate the validation speed of behavioral specifications by allowing a user to interact with an executing code at the ...
Inki Hong, Darko Kirovski, Miodrag Potkonjak, Mari...
RTSS
1998
IEEE
15 years 3 months ago
Symbolic Schedulability Analysis of Real-Time Systems
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities....
Hee-Hwan Kwak, Insup Lee, Anna Philippou, Jin-Youn...
DATE
1999
IEEE
123views Hardware» more  DATE 1999»
15 years 3 months ago
An Algorithm for Face-Constrained Encoding of Symbols Using Minimum Code Length
Different logic synthesis tasks have been formulated as input encoding problems but restricted to use a minimum number of binary variables. This paper presents an original column ...
Manuel Martínez, Maria J. Avedillo, Jos&eac...
79
Voted
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
15 years 4 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki