The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Robert F. Stärk: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.018secs, Finished in 0.019secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002