Sciweavers

2398 search results - page 69 / 480
» Constraint Programming and Graph Algorithms
Sort
View
SCAM
2005
IEEE
15 years 10 months ago
Control Flow Graph Reconstruction for Assembly Language Programs with Delayed Instructions
Most software for embedded systems, including digital signal processing systems, is coded in assembly language. For both understanding the software and for reverse compiling it to...
Nerina Bermudo, Andreas Krall, R. Nigel Horspool
122
Voted
LOPSTR
2004
Springer
15 years 10 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
DBPL
2007
Springer
103views Database» more  DBPL 2007»
15 years 8 months ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach
122
Voted
UM
2009
Springer
15 years 11 months ago
Recognition of Users' Activities Using Constraint Satisfaction
Ideally designed software allow users to explore and pursue interleaving plans, making it challenging to automatically recognize user interactions. The recognition algorithms prese...
Swapna Reddy, Ya'akov Gal, Stuart M. Shieber
ICFP
2001
ACM
16 years 4 months ago
Compositional Explanation of Types and Algorithmic Debugging of Type Errors
The type systems of most typed functional programming languages are based on the Hindley-Milner type system. A practical problem with these type systems is that it is often hard t...
Olaf Chitil