Robert F. Stärk

36 papers A* 1B 8Misc 2Journal 16Unranked 6
YearRankTypeTitle / Venue / Authors
2012 Misc conf
Mixed-initiative data mining with Bayesian networks.
CogSIMA
Robert F. Stärk, Michael Farry, Jonathan D. Pfautz
2012 — conf
Visualizing large scale patterns and anomalies in geospatial data: VAST 2012 Mini Challenge #1 award: Honorable mention for good visual design.
IEEE VAST
Robert F. Stärk, Arthur Wollocko, Michael Borys, Megan Kierstead, Michael Farry
2007 J jnl
Information Algebras and Consequence Operators.
Logica Universalis
Jürg Kohlas, Robert F. Stärk
2005 J jnl
A high-level modular definition of the semantics of C#.
Theor. Comput. Sci.
Egon Börger, Nicu G. Fruja, Vincenzo Gervasi, Robert F. Stärk
2005 J jnl
A logic for secure memory access of abstract state machines.
Theor. Comput. Sci.
Stanislas Nanchen, Robert F. Stärk
2005 J jnl
Axioms for strict and lazy functional programs.
Ann. Pure Appl. Log.
Robert F. Stärk
2005 J jnl
Formal specification and verification of the C# thread model.
Theor. Comput. Sci.
Robert F. Stärk
2004 — conf
A Security Logic for Abstract State Machines.
Abstract State Machines
Stanislas Nanchen, Robert F. Stärk
2004 — conf
An ASM Specification of C# Threads and the .NET Memory Model.
Abstract State Machines
Robert F. Stärk, Egon Börger
2003 — book
Abstract State Machines. A Method for High-Level System Design and Analysis
Egon Börger, Robert F. Stärk
2003 J jnl
Completeness of a Bytecode Verifier and a Certifying Java-to-JVM Compiler.
J. Autom. Reason.
Robert F. Stärk, Joachim Schmid
2003 — conf
Exploiting Abstraction for Specification Reuse. The Java/C# Case Study.
FMCO
Egon Börger, Robert F. Stärk
2003 — conf
The Hidden Computation Stepsof Turbo Abstract State Machines.
Abstract State Machines
Nicu G. Fruja, Robert F. Stärk
2001 B conf
A Logic for Abstract State Machines.
CSL
Robert F. Stärk, Stanislas Nanchen
2001 J jnl
A Logic for Abstract State Machines.
J. Univers. Comput. Sci.
Robert F. Stärk, Stanislas Nanchen
2001 — book
Java and the Java Virtual Machine: Definition, Verification, Validation
Robert F. Stärk, Joachim Schmid, Egon Börger
2001 — ed.
Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings
PTCS
Reinhard Kahle, Peter Schroeder-Heister, Robert F. Stärk
1999 J jnl
A Direct Proof of the Completeness of SLDNF-Resolution.
J. Log. Comput.
Robert F. Stärk
1998 J jnl
The Theoretical Foundations of LPTP (A Logic Program Theorem Prover).
J. Log. Program.
Robert F. Stärk
1998 J jnl
Why the Constant 'Undefined'? Logics of Partial Terms for Strict and Non-Strict Functional Programming Languages.
J. Funct. Program.
Robert F. Stärk
1997 Misc conf
Formal Verification of Logic Programs: Foundations and Implementation.
LFCS
Robert F. Stärk
1996 B conf
Call-by-Value, Call-by-Name and the Logic of Values.
CSL
Robert F. Stärk
1996 J jnl
Multi-Valued Autoepistemic Logic.
Ann. Math. Artif. Intell.
Robert F. Stärk
1996 — conf
Total Correctness of Logic Programs: A Formal Approach.
ELP
Robert F. Stärk
1995 B conf
A Transformation of Propositional Prolog Programs into Classical Logic.
LPNMR
Robert F. Stärk
1995 J jnl
First-order theories for pure Prolog programs with negation.
Arch. Math. Log.
Robert F. Stärk
1995 B conf
Loop Checking and the Wll-Founded Semantics.
LPNMR
Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk
1994 J jnl
Cut-Property and Negation as Failure.
Int. J. Found. Comput. Sci.
Robert F. Stärk
1994 J jnl
Input/Output Dependencies of Normal Logic Programs.
J. Log. Comput.
Robert F. Stärk
1994 A* conf
The Declarative Semantics of the Prolog Selection Rule
LICS
Robert F. Stärk
1993 J jnl
The Defining Power of Stratified and Hierarchical Logic Programs.
J. Log. Program.
Gerhard Jäger, Robert F. Stärk
1992 B conf
Negation-Complete Logic Programs.
CSL
Robert F. Stärk
1991 J jnl
A Complete Axiomatization of the Three-Valued Completion of Logic Programs.
J. Log. Comput.
Robert F. Stärk
1990 B conf
On the Existence of Fixpoints in Moore's Autoepistemic Logic and the Non-Monotonic Logic of McDermott and Doyle.
CSL
Robert F. Stärk
1989 B conf
A Direct Proof for the Completeness of SLD-Resolution.
CSL
Robert F. Stärk
1989 B conf
A Quantifier-Free Completion of Logic Programs.
CSL
Robert F. Stärk