Robert F. Stärk

According to our database, Robert F. Stärk authored at least 34 papers between 1989 and 2012.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2012

Visualizing large scale patterns and anomalies in geospatial data: VAST 2012 Mini Challenge #1 award: Honorable mention for good visual design.

Robert F. Stärk, Arthur Wollocko, Michael Borys, Megan Kierstead, Michael Farry

Proceedings of the 7th IEEE Conference on Visual Analytics Science and Technology, 2012

Mixed-initiative data mining with Bayesian networks.

Robert F. Stärk, Michael Farry, Jonathan D. Pfautz

Proceedings of the IEEE International Multi-Disciplinary Conference on Cognitive Methods in Situation Awareness and Decision Support, 2012

2007

Information Algebras and Consequence Operators.

Jürg Kohlas, Robert F. Stärk

Logica Universalis, 2007

2005

Formal specification and verification of the C# thread model.

Robert F. Stärk

Theor. Comput. Sci., 2005

A logic for secure memory access of abstract state machines.

Stanislas Nanchen, Robert F. Stärk

Theor. Comput. Sci., 2005

A high-level modular definition of the semantics of C#.

Egon Börger, Nicu G. Fruja, Vincenzo Gervasi, Robert F. Stärk

Theor. Comput. Sci., 2005

Axioms for strict and lazy functional programs.

Robert F. Stärk

Ann. Pure Appl. Log., 2005

2004

An ASM Specification of C# Threads and the .NET Memory Model.

Robert F. Stärk, Egon Börger

Proceedings of the Abstract State Machines 2004. Advances in Theory and Practice, 2004

A Security Logic for Abstract State Machines.

Stanislas Nanchen, Robert F. Stärk

Proceedings of the Abstract State Machines 2004. Advances in Theory and Practice, 2004

2003

Completeness of a Bytecode Verifier and a Certifying Java-to-JVM Compiler.

Robert F. Stärk, Joachim Schmid

J. Autom. Reason., 2003

Exploiting Abstraction for Specification Reuse. The Java/C# Case Study.

Egon Börger, Robert F. Stärk

Proceedings of the Formal Methods for Components and Objects, 2003

The Hidden Computation Stepsof Turbo Abstract State Machines.

Nicu G. Fruja, Robert F. Stärk

Proceedings of the Abstract State Machines, 2003

Abstract State Machines. A Method for High-Level System Design and Analysis

Egon Börger, Robert F. Stärk

Springer, ISBN: 3540007024, 2003

2001

A Logic for Abstract State Machines.

Robert F. Stärk, Stanislas Nanchen

J. Univers. Comput. Sci., 2001

Java and the Java Virtual Machine: Definition, Verification, Validation

Robert F. Stärk, Joachim Schmid, Egon Börger

Springer, 2001

1999

A Direct Proof of the Completeness of SLDNF-Resolution.

Robert F. Stärk

J. Log. Comput., 1999

1998

The Theoretical Foundations of LPTP (A Logic Program Theorem Prover).

Robert F. Stärk

J. Log. Program., 1998

Why the Constant 'Undefined'? Logics of Partial Terms for Strict and Non-Strict Functional Programming Languages.

Robert F. Stärk

J. Funct. Program., 1998

1997

Formal Verification of Logic Programs: Foundations and Implementation.

Robert F. Stärk

Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1996

Multi-Valued Autoepistemic Logic.

Robert F. Stärk

Ann. Math. Artif. Intell., 1996

Total Correctness of Logic Programs: A Formal Approach.

Robert F. Stärk

Proceedings of the Extensions of Logic Programming, 5th International Workshop, 1996

Call-by-Value, Call-by-Name and the Logic of Values.

Robert F. Stärk

Proceedings of the Computer Science Logic, 10th International Workshop, 1996

1995

First-order theories for pure Prolog programs with negation.

Robert F. Stärk

Arch. Math. Log., 1995

A Transformation of Propositional Prolog Programs into Classical Logic.

Robert F. Stärk

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1995

Loop Checking and the Wll-Founded Semantics.

Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1995

1994

Input/Output Dependencies of Normal Logic Programs.

Robert F. Stärk

J. Log. Comput., 1994

Cut-Property and Negation as Failure.

Robert F. Stärk

Int. J. Found. Comput. Sci., 1994

The Declarative Semantics of the Prolog Selection Rule

Robert F. Stärk

Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1993

The Defining Power of Stratified and Hierarchical Logic Programs.

Gerhard Jäger, Robert F. Stärk

J. Log. Program., 1993

1992

Negation-Complete Logic Programs.

Robert F. Stärk

Proceedings of the Computer Science Logic, 6th Workshop, 1992

1991

A Complete Axiomatization of the Three-Valued Completion of Logic Programs.

Robert F. Stärk

J. Log. Comput., 1991

1990

On the Existence of Fixpoints in Moore's Autoepistemic Logic and the Non-Monotonic Logic of McDermott and Doyle.

Robert F. Stärk

Proceedings of the Computer Science Logic, 4th Workshop, 1990

1989

A Quantifier-Free Completion of Logic Programs.

Robert F. Stärk

Proceedings of the CSL '89, 1989

A Direct Proof for the Completeness of SLD-Resolution.

Robert F. Stärk

Proceedings of the CSL '89, 1989