UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Proof Theory in Computer Science: International Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7-12, 2001. Proceedings

1, 2001

Volltextzugriff (PDF)

Formal specification and verification of the C ♯ thread model

Theoretical computer science, 2005-10, Vol.343 (3), p.482-508

Staerk, Robert F

2005

Volltextzugriff (PDF)

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

Abstract State Machines 2004. Advances in Theory and Practice, 2004, p.38-60

2004

Volltextzugriff (PDF)

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

Journal of automated reasoning, 2003-05, Vol.30 (3-4), p.323-361

2003

Volltextzugriff (PDF)

The Hidden Computation Steps of Turbo Abstract State Machines

Abstract State Machines 2003, 2003, p.244-262

2003

Volltextzugriff (PDF)

The finite stages of inductive definitions

Gödel '96, 2017, p.267-290

Stärk, Robert F.

2017

Volltextzugriff (PDF)

A Security Logic for Abstract State Machines

Abstract State Machines 2004. Advances in Theory and Practice, 2004, p.169-185

2004

Volltextzugriff (PDF)

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

Formal Methods for Components and Objects, 2004, p.42-76

2004

Volltextzugriff (PDF)

Reducing Risk in System Design Through Human-Systems Integration

Ergonomics in design, 2010-04, Vol.18 (2), p.18-22

2010

Volltextzugriff (PDF)

Information Algebras and Consequence Operators

Logica universalis, 2007-01, Vol.1 (1), p.139-165

2007

Volltextzugriff (PDF)

A logic for secure memory access of abstract state machines: Abstract state machines and high-level system design and analysis

Theoretical computer science, 2005, Vol.336 (2-3), p.343-365

2005

Volltextzugriff (PDF)

A high-level modular definition of the semantics of C

Theoretical computer science, 2005, Vol.336 (2), p.235-284

2005

Volltextzugriff (PDF)

A Logic for Abstract State Machines

Computer Science Logic, 2001, p.217-231

2001

Volltextzugriff (PDF)

A direct proof for the completeness of SLD-resolution

CSL '89, 2005, p.382-383

2005

Volltextzugriff (PDF)

A high-level modular definition of the semantics of C#: Abstract state machines and high-level system design and analysis

Theoretical computer science, 2005, Vol.336 (2-3), p.235-284

2005

Volltextzugriff (PDF)

Axioms for strict and lazy functional programs

Annals of pure and applied logic, 2005-05, Vol.133 (1), p.293-318

Stärk, Robert F.

2005

Volltextzugriff (PDF)

A logic for secure memory access of abstract state machines

Theoretical computer science, 2005, Vol.336 (2), p.343-365

2005

Volltextzugriff (PDF)

Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages

Journal of functional programming, 1998-03, Vol.8 (2), p.97-129

STÄRK, ROBERT F.

1998

Volltextzugriff (PDF)

A quantifier-free completion of logic programs

CSL '89, 2005, p.384-395

2005

Volltextzugriff (PDF)

Formal verification of logic programs: Foundations and implementation

Logical Foundations of Computer Science, 2005, p.354-368

2005

Volltextzugriff (PDF)

On the existence of fixpoints in moore's autoepistemic logic and the non-monotonic logic of McDermott and Doyle

Computer Science Logic, 2005, p.354-365

2005

Volltextzugriff (PDF)

Total correctness of logic programs: A formal approach

Extensions of Logic Programming, 2005, p.237-254

2005

Volltextzugriff (PDF)

Negation-complete logic programs

Computer Science Logic, 2005, p.403-409

2005

Volltextzugriff (PDF)

Call-by-Value, call-by-name and the logic of values

Computer Science Logic, 1997, p.431-445

1997

Volltextzugriff (PDF)

Input/Output Dependencies of Normal Logic Programs

Journal of logic and computation, 1994-06, Vol.4 (3), p.249-262

STÄRK, ROBERT F.

1994

Volltextzugriff (PDF)

1 – 25 von 316

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(280)
Mit Volltextzugriff
(271)

Publikationsform

2 weitere anzeigen...

Weniger anzeigen...

Sprache

Erscheinungsjahr

n.n

Thema

Science & Technology
(222)
Life Sciences & Biomedicine
(111)
Humans
(108)
Physical Sciences
(78)
Exact Sciences And Technology
(56)
Male
(53)
Female
(47)
Astronomy & Astrophysics
(43)
Biological And Medical Sciences
(40)
Technology
(40)
Astronomy
(38)
Earth, Ocean, Space
(38)
Adult
(37)
Medical Sciences
(34)
Gamma Rays: Observations
(29)
Middle Aged
(29)
Aged
(28)
Science & Technology - Other Topics
(24)
Animals
(21)
Genomes
(21)

15 weitere anzeigen...

Weniger anzeigen...

Zeitschrift / Serie

5 weitere anzeigen...

Weniger anzeigen...

Menü

Weitere Dienste

Einstellungen

Proof Theory in Computer Science: International Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7-12, 2001. Proceedings

Formal specification and verification of the C ♯ thread model

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

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

The Hidden Computation Steps of Turbo Abstract State Machines

The finite stages of inductive definitions

A Security Logic for Abstract State Machines

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

Reducing Risk in System Design Through Human-Systems Integration

Information Algebras and Consequence Operators

A logic for secure memory access of abstract state machines: Abstract state machines and high-level system design and analysis

A high-level modular definition of the semantics of C

A Logic for Abstract State Machines

A direct proof for the completeness of SLD-resolution

A high-level modular definition of the semantics of C#: Abstract state machines and high-level system design and analysis

Axioms for strict and lazy functional programs

A logic for secure memory access of abstract state machines

Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages

A quantifier-free completion of logic programs

Formal verification of logic programs: Foundations and implementation

On the existence of fixpoints in moore's autoepistemic logic and the non-monotonic logic of McDermott and Doyle

Total correctness of logic programs: A formal approach

Negation-complete logic programs

Call-by-Value, call-by-name and the logic of values

Input/Output Dependencies of Normal Logic Programs

Suchergebnisse filtern