dblp.uni-trier.dewww.uni-trier.de

Robert F. Stärk

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2005
32EERobert F. Stärk: Axioms for strict and lazy functional programs. Ann. Pure Appl. Logic 133(1-3): 293-318 (2005)
31EEEgon Börger, Nicu G. Fruja, Vincenzo Gervasi, Robert F. Stärk: A high-level modular definition of the semantics of C#. Theor. Comput. Sci. 336(2-3): 235-284 (2005)
30EEStanislas Nanchen, Robert F. Stärk: A logic for secure memory access of abstract state machines. Theor. Comput. Sci. 336(2-3): 343-365 (2005)
29EERobert F. Stärk: Formal specification and verification of the C# thread model. Theor. Comput. Sci. 343(3): 482-508 (2005)
2004
28EEStanislas Nanchen, Robert F. Stärk: A Security Logic for Abstract State Machines. Abstract State Machines 2004: 169-185
27EERobert F. Stärk, Egon Börger: An ASM Specification of C# Threads and the .NET Memory Model. Abstract State Machines 2004: 38-60
2003
26 Egon Börger, Robert F. Stärk: Abstract State Machines. A Method for High-Level System Design and Analysis Springer 2003
25EENicu G. Fruja, Robert F. Stärk: The Hidden Computation Stepsof Turbo Abstract State Machines. Abstract State Machines 2003: 244-262
24EEEgon Börger, Robert F. Stärk: Exploiting Abstraction for Specification Reuse. The Java/C# Case Study. FMCO 2003: 42-76
23EERobert F. Stärk, Joachim Schmid: Completeness of a Bytecode Verifier and a Certifying Java-to-JVM Compiler. J. Autom. Reasoning 30(3-4): 323-361 (2003)
2001
22 Robert F. Stärk, Joachim Schmid, Egon Börger: Java and the Java Virtual Machine: Definition, Verification, Validation Springer 2001
21 Reinhard Kahle, Peter Schroeder-Heister, Robert F. Stärk: Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings Springer 2001
20EERobert F. Stärk, Stanislas Nanchen: A Logic for Abstract State Machines. CSL 2001: 217-231
19EERobert F. Stärk, Stanislas Nanchen: A Logic for Abstract State Machines. J. UCS 7(11): 980-1005 (2001)
1999
18EERobert F. Stärk: A Direct Proof of the Completeness of SLDNF-Resolution. J. Log. Comput. 9(1): 47-61 (1999)
1998
17 Robert F. Stärk: Why the Constant 'Undefined'? Logics of Partial Terms for Strict and Non-Strict Functional Programming Languages. J. Funct. Program. 8(2): 97-129 (1998)
16 Robert F. Stärk: The Theoretical Foundations of LPTP (A Logic Program Theorem Prover). J. Log. Program. 36(3): 241-269 (1998)
1997
15 Robert F. Stärk: Formal Verification of Logic Programs: Foundations and Implementation. LFCS 1997: 354-368
1996
14 Robert F. Stärk: Call-by-Value, Call-by-Name and the Logic of Values. CSL 1996: 431-445
13 Robert F. Stärk: Total Correctness of Logic Programs: A Formal Approach. ELP 1996: 237-254
12 Robert F. Stärk: Multi-Valued Autoepistemic Logic. Ann. Math. Artif. Intell. 18(2-4): 159-174 (1996)
1995
11 Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk: Loop Checking and the Wll-Founded Semantics. LPNMR 1995: 127-142
10 Robert F. Stärk: A Transformation of Propositional Prolog Programs into Classical Logic. LPNMR 1995: 302-315
1994
9 Robert F. Stärk: The Declarative Semantics of the Prolog Selection Rule LICS 1994: 252-261
8 Robert F. Stärk: Cut-Property and Negation as Failure. Int. J. Found. Comput. Sci. 5(2): 129-164 (1994)
7 Robert F. Stärk: Input/Output Dependencies of Normal Logic Programs. J. Log. Comput. 4(3): 249-262 (1994)
1993
6 Gerhard Jäger, Robert F. Stärk: The Defining Power of Stratified and Hierarchical Logic Programs. J. Log. Program. 15(1&2): 55-77 (1993)
1992
5 Robert F. Stärk: Negation-Complete Logic Programs. CSL 1992: 403-409
1991
4 Robert F. Stärk: A Complete Axiomatization of the Three-Valued Completion of Logic Programs. J. Log. Comput. 1(6): 811-834 (1991)
1990
3 Robert F. Stärk: On the Existence of Fixpoints in Moore's Autoepistemic Logic and the Non-Monotonic Logic of McDermott and Doyle. CSL 1990: 354-365
1989
2 Robert F. Stärk: A Direct Proof for the Completeness of SLD-Resolution. CSL 1989: 382-383
1 Robert F. Stärk: A Quantifier-Free Completion of Logic Programs. CSL 1989: 384-395

Coauthor Index

1Egon Börger [22] [24] [26] [27] [31]
2Nicu G. Fruja [25] [31]
3Vincenzo Gervasi [31]
4Gerhard Jäger [6]
5Reinhard Kahle [21]
6Vladimir Lifschitz [11]
7Norman McCain [11]
8Stanislas Nanchen [19] [20] [28] [30]
9Teodor C. Przymusinski [11]
10Joachim Schmid [22] [23]
11Peter Schroeder-Heister [21]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)