Sciweavers

1224 search results - page 112 / 245
» Theory decision by decomposition
Sort
View
ICFP
2007
ACM
16 years 6 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson

Book
640views
17 years 5 months ago
Introduction to Pattern Recognition
"Pattern recognition techniques are concerned with the theory and algorithms of putting abstract objects, e.g., measurements made on physical objects, into categories. Typical...
Sargur Srihari
EEE
2005
IEEE
16 years 23 hour ago
A Pattern Language for Decentralized Coordination and Negotiation Protocols
Currently negotiation covers a huge and unstructured domain of negotiation- and coordination protocols and associated strategies. Researchers and practitioners like system enginee...
Adrian Paschke, Christine Kiss, Samer Al-Hunaty
BIRTHDAY
2005
Springer
15 years 12 months ago
Timing the Untimed: Terminating Successfully While Being Conservative
Abstract. There have been several timed extensions of ACP-style process algebras with successful termination. None of them, to our knowledge, are equationally conservative (ground-...
Jos C. M. Baeten, Mohammad Reza Mousavi, Michel A....
LPAR
2005
Springer
15 years 12 months ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...