Sciweavers

1269 search results - page 191 / 254
» Pi-Calculus in Logical Form
Sort
View
SIGSOFT
2006
ACM
14 years 10 months ago
Lightweight extraction of syntactic specifications
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
Mana Taghdiri, Robert Seater, Daniel Jackson
WWW
2007
ACM
14 years 10 months ago
Towards Deeper Understanding of the Search Interfaces of the Deep Web
Many databases have become Web-accessible through form-based search interfaces (i.e., HTML forms) that allow users to specify complex and precise queries to access the underlying ...
Hai He, Weiyi Meng, Yiyao Lu, Clement T. Yu, Zongh...
WWW
2001
ACM
14 years 10 months ago
Algorithms and programming models for efficient representation of XML for Internet applications
XML is poised to take the World-Wide-Web to the next level of innovation. XML data, large or small, with or without associated schema, will be exchanged between increasing number ...
Neel Sundaresan, Reshad Moussa
CADE
2006
Springer
14 years 10 months ago
Automatic Construction and Verification of Isotopy Invariants
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
Volker Sorge, Andreas Meier, Roy L. McCasland, Sim...
CADE
2002
Springer
14 years 10 months ago
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
Eugene Goldberg