Robert F. Stärk - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2012

Visualizing large scale patterns and anomalies in geospatial data: VAST 2012 Mini Challenge #1 award: Honorable mention for good visual designRobert F. Stärk, Arthur Wollocko, Michael Borys, Megan Kierstead, Michael Farry. ieeevast 2012: 271-272 [doi]

Mixed-initiative data mining with Bayesian networksRobert F. Stärk, Michael Farry, Jonathan D. Pfautz. cogsima 2012: 107-110 [doi]

2007

Information Algebras and Consequence OperatorsJürg Kohlas, Robert F. Stärk. lu, 1(1):139-165, 2007. [doi]

2005

A high-level modular definition of the semantics of C#Egon Börger, Nicu G. Fruja, Vincenzo Gervasi, Robert F. Stärk. TCS, 336(2-3):235-284, 2005. [doi]

A logic for secure memory access of abstract state machinesStanislas Nanchen, Robert F. Stärk. TCS, 336(2-3):343-365, 2005. [doi]

Axioms for strict and lazy functional programsRobert F. Stärk. APAL, 133(1-3):293-318, 2005. [doi]

Formal specification and verification of the C# thread modelRobert F. Stärk. TCS, 343(3):482-508, 2005. [doi]

2004

A Security Logic for Abstract State MachinesStanislas Nanchen, Robert F. Stärk. asmta 2004: 169-185 [doi]

An ASM Specification of C# Threads and the .NET Memory ModelRobert F. Stärk, Egon Börger. asmta 2004: 38-60 [doi]

2003

Abstract State Machines. A Method for High-Level System Design and AnalysisEgon Börger, Robert F. Stärk. Springer, 2003.

Exploiting Abstraction for Specification Reuse. The Java/C# Case StudyEgon Börger, Robert F. Stärk. FMCO 2004: 42-76 [doi]

The Hidden Computation Stepsof Turbo Abstract State MachinesNicu G. Fruja, Robert F. Stärk. asmta 2003: 244-262 [doi]

Completeness of a Bytecode Verifier and a Certifying Java-to-JVM CompilerRobert F. Stärk, Joachim Schmid. JAR, 30(3-4):323-361, 2003. [doi]

2001

A Logic for Abstract State MachinesRobert F. Stärk, Stanislas Nanchen. jucs, 7(11):980-1005, 2001. [doi]

A Logic for Abstract State MachinesRobert F. Stärk, Stanislas Nanchen. csl 2001: 217-231 [doi]

Java and the Java Virtual Machine: Definition, Verification, ValidationRobert F. Stärk, Joachim Schmid, Egon Börger. Springer, 2001.

1999

A Direct Proof of the Completeness of SLDNF-ResolutionRobert F. Stärk. logcom, 9(1):47-61, 1999. [doi]

1998

Why the Constant Undefined ? Logics of Partial Terms for Strict and Non-Strict Functional Programming LanguagesRobert F. Stärk. JFP, 8(2):97-129, 1998.

The Theoretical Foundations of LPTP (A Logic Program Theorem Prover)Robert F. Stärk. jlp, 36(3):241-269, 1998.

1997

Formal Verification of Logic Programs: Foundations and ImplementationRobert F. Stärk. lfcs 1997: 354-368

1996

Multi-Valued Autoepistemic LogicRobert F. Stärk. AMAI, 18(2-4):159-174, 1996.

Call-by-Value, Call-by-Name and the Logic of ValuesRobert F. Stärk. csl 1997: 431-445

Total Correctness of Logic Programs: A Formal ApproachRobert F. Stärk. elp 1996: 237-254

1995

Loop Checking and the Wll-Founded SemanticsVladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk. lpnmr 1995: 127-142

A Transformation of Propositional Prolog Programs into Classical LogicRobert F. Stärk. lpnmr 1995: 302-315

First-order theories for pure Prolog programs with negationRobert F. Stärk. AML, 34(2):113-144, 1995. [doi]

1994

Input/Output Dependencies of Normal Logic ProgramsRobert F. Stärk. logcom, 4(3):249-262, 1994.

Cut-Property and Negation as FailureRobert F. Stärk. ijfcs, 5(2):129-164, 1994.

The Declarative Semantics of the Prolog Selection RuleRobert F. Stärk. lics 1994: 252-261

1993

The Defining Power of Stratified and Hierarchical Logic ProgramsGerhard Jäger, Robert F. Stärk. jlp, 15(1&2):55-77, 1993.

1992

Negation-Complete Logic ProgramsRobert F. Stärk. csl 1993: 403-409

1991

A Complete Axiomatization of the Three-Valued Completion of Logic ProgramsRobert F. Stärk. logcom, 1(6):811-834, 1991.

1990

On the Existence of Fixpoints in Moore s Autoepistemic Logic and the Non-Monotonic Logic of McDermott and DoyleRobert F. Stärk. csl 1991: 354-365

1989

A Direct Proof for the Completeness of SLD-ResolutionRobert F. Stärk. csl 1990: 382-383

A Quantifier-Free Completion of Logic ProgramsRobert F. Stärk. csl 1990: 384-395

Sign in or sign up to see more results.

runs on WebDSL