Sciweavers

837 search results - page 58 / 168
» Proof Development with OMEGA
Sort
View
NGC
2000
Springer
124views Communications» more  NGC 2000»
13 years 9 months ago
Temporal Disjunctive Logic Programming
In this paper we introduce the logic programminglanguage Disjunctive Chronolog which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive C...
Manolis Gergatsoulis, Panos Rondogiannis, Themis P...
IANDC
2002
84views more  IANDC 2002»
13 years 9 months ago
Decidability of Split Equivalence
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all...
Y. Abramson, Alexander Moshe Rabinovich
JAR
2010
122views more  JAR 2010»
13 years 4 months ago
Partial and Nested Recursive Function Definitions in Higher-order Logic
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
Alexander Krauss
POPL
2011
ACM
13 years 24 days ago
The essence of compiling with traces
The technique of trace-based just-in-time compilation was introduced by Bala et al. and was further developed by Gal et al. It currently enjoys success in Mozilla Firefox’s Java...
Shu-yu Guo, Jens Palsberg
SERP
2007
13 years 11 months ago
AppDetector: A Tool Prototype for Visualizing Java Code Dependencies on Relational Databases
- Modern tools have simplified the development of the enterprise applications by bridging gaps across various technologies like file systems, relational databases, messaging, and w...
Sai Ravindran, Paul L. Bergstein