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...

Deterministic quantum teleportation with feed-forward in a solid state system

Nature (London), 2013-08, Vol.500 (7462), p.319-322

2013

Volltextzugriff (PDF)

Verification of java bytecode using analysis and transformation of logic programs

Lecture Notes in Computer Science, 2007, Vol.4354, p.124-139

2007

Volltextzugriff (PDF)

Some techniques for automated, resource-aware distributed and mobile computing in a multi-paradigm programming system

Lecture notes in computer science, 2004, p.21-36

2004

Volltextzugriff (PDF)

Efficient Local Unfolding with Ancestor Stacks for Full Prolog

Lecture notes in computer science, 2005, p.149-165

2005

Volltextzugriff (PDF)

Normalizable Horn clauses, strongly recognizable relations, and Spi

Lecture notes in computer science, 2002, p.20-35

2002

Volltextzugriff (PDF)

Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library

Lecture notes in computer science, 2002, Vol.2477, p.213-229

2002

Volltextzugriff (PDF)

Making abstract model checking strongly preserving

Lecture notes in computer science, 2002, p.411-427

2002

Volltextzugriff (PDF)

Abstraction-Carrying Code

Lecture notes in computer science, 2005, p.380-397

2005

Volltextzugriff (PDF)

From Secrecy to Authenticity in Security Protocols

Lecture notes in computer science, 2002, Vol.2477, p.342-359

2002

Volltextzugriff (PDF)

Static Confidentiality Enforcement for Distributed Programs

Lecture notes in computer science, 2002, Vol.2477, p.376-394

2002

Volltextzugriff (PDF)

An Improved Constraint-Based System for the Verification of Security Protocols

Lecture notes in computer science, 2002, Vol.2477, p.326-341

2002

Volltextzugriff (PDF)

An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages

Lecture notes in computer science, 2002, Vol.2477, p.180-195

2002

Volltextzugriff (PDF)

More Precise Yet Efficient Type Inference for Logic Programs

Lecture notes in computer science, 2002, Vol.2477, p.102-116

2002

Volltextzugriff (PDF)

Pipeline Modeling for Timing Analysis

Lecture notes in computer science, 2002, Vol.2477, p.294-309

2002

Volltextzugriff (PDF)

A Few Graph-Based Relational Numerical Abstract Domains

Lecture notes in computer science, 2002, Vol.2477, p.117-132

2002

Volltextzugriff (PDF)

Program development using abstract interpretation (and the ciao system preprocessor)

Lecture notes in computer science, 2003, Vol.2694, p.127-152

2003

Volltextzugriff (PDF)

Polynomial Constants Are Decidable

Lecture notes in computer science, 2002, Vol.2477, p.4-19

2002

Volltextzugriff (PDF)

Automated Verification of Concurrent Linked Lists with Counters

Lecture notes in computer science, 2002, Vol.2477, p.69-84

2002

Volltextzugriff (PDF)

Security Typings by Abstract Interpretation

Lecture notes in computer science, 2002, Vol.2477, p.360-375

2002

Volltextzugriff (PDF)

A Generic Framework for the Analysis and Specialization of Logic Programs

Lecture notes in computer science, 2005, p.407-409

1ère éd, 2005

Volltextzugriff (PDF)

Program Debugging and Validation Using Semantic Approximations and Partial Specifications

Automata, Languages and Programming, 2002, Vol.2380, p.69-72

2002

Volltextzugriff (PDF)

High-level languages for small devices: a case study

International Conference on Compilers, Architecture and Synthesis for Embedded Systems: Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems; 22-25 Oct. 2006, 2006, p.271-281

2006

Volltextzugriff (PDF)