UB Paderborn / Katalog / Suche / in CDI

On dynamic aspects of OOD frameworks in component-based software development in computational logic

Lecture notes in computer science, 2000, p.42-61

2000

Volltextzugriff (PDF)

Infinite State Model Checking by Abstract Interpretation and Program Specialisation

Lecture notes in computer science, 2000, p.62-81

2000

Volltextzugriff (PDF)

Constraint Logic Programming Applied to Model Checking

Lecture notes in computer science, 2000, p.30-41

2000

Volltextzugriff (PDF)

Context-Moving Transformations for Function Verification

Lecture notes in computer science, 2000, p.293-312

2000

Volltextzugriff (PDF)

Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programs

Lecture notes in computer science, 2000, p.273-292

2000

Volltextzugriff (PDF)

Imperative Program Specialisation: An Approach Using CLP

Lecture notes in computer science, 2000, p.102-117

2000

Volltextzugriff (PDF)

Annotations for Prolog – A Concept and Runtime Handling

Lecture notes in computer science, 2000, p.234-254

2000

Volltextzugriff (PDF)

Proof Obligations of the B Formal Method: Local Proofs Ensure Global Consistency

Lecture notes in computer science, 2000, p.10-29

2000

Volltextzugriff (PDF)

Roles of Program Extension

Lecture notes in computer science, 2000, p.136-155

2000

Volltextzugriff (PDF)

Making Mercury Programs Tail Recursive

Lecture notes in computer science, 2000, p.196-215

2000

Volltextzugriff (PDF)

Transformation Rules for Logic Programs with Goals as Arguments

Lecture notes in computer science, 2000, p.176-195

2000

Volltextzugriff (PDF)

Verification by Testing for Recursive Program Schemes

Lecture notes in computer science, 2000-01, Vol.1817 (Logic-Based Program Synthesis and Transformation, 9th International Workshop, LOPSTR'99, Selected Pa), p.255-272

2000

Volltextzugriff (PDF)

Quasi-Ordered Structure in Highly Cross-Linked Poly(acrylamide) Gels

Macromolecules, 1997-10, Vol.30 (20), p.6194-6198

1997

Volltextzugriff (PDF)

Norms on terms and their use in proving universal termination of a logic program

Theoretical computer science, 1994-02, Vol.124 (2), p.297-328

1994

Volltextzugriff (PDF)

Mode Analysis Domains for Typed Logic Programs

Lecture notes in computer science, 2000, p.82-101

2000

Volltextzugriff (PDF)

A compositional semantics for logic programs

Theoretical computer science, 1994-01, Vol.122 (1), p.3-47

1994

Volltextzugriff (PDF)

A method for specializing logic programs

ACM transactions on programming languages and systems, 1990-04, Vol.12 (2), p.253-302

1990

Volltextzugriff (PDF)

Theoretical Design of Substituted Tetrathia-[7]-Helicenes with Large Second-Order Nonlinear Optical Responses

Chemphyschem, 2004-09, Vol.5 (9), p.1438-1442

2004

Volltextzugriff (PDF)

The Replacement Operation for CCP Programs

Lecture notes in computer science, 2000, p.216-233

2000

Volltextzugriff (PDF)

Specialising Finite Domain Programs Using Polyhedra

Lecture notes in computer science, 2000, p.118-135

2000

Volltextzugriff (PDF)

Transformation of Left Terminating Programs

Lecture notes in computer science, 2000, p.156-175

2000

Volltextzugriff (PDF)

Bisimulation and Unwinding for Verifying Possibilistic Security Properties

Lecture notes in computer science, 2003, p.223-237

2003

Volltextzugriff (PDF)

Algebraic Specification and Program Development by Stepwise Refinement

Lecture notes in computer science, 2000, p.1-9

2000

Volltextzugriff (PDF)

A microcalorimetric method for the evaluation of copper surface area in CuZnO catalyst

Journal of catalysis, 1984, Vol.87 (2), p.443-451

1984

Volltextzugriff (PDF)

A multimembrane enzyme reactor operating in an electric field

Chromatographia, 1997, Vol.45 (1), p.441-444

1997

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

On dynamic aspects of OOD frameworks in component-based software development in computational logic

Infinite State Model Checking by Abstract Interpretation and Program Specialisation

Constraint Logic Programming Applied to Model Checking

Context-Moving Transformations for Function Verification

Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programs

Imperative Program Specialisation: An Approach Using CLP

Annotations for Prolog – A Concept and Runtime Handling

Proof Obligations of the B Formal Method: Local Proofs Ensure Global Consistency

Roles of Program Extension

Making Mercury Programs Tail Recursive

Transformation Rules for Logic Programs with Goals as Arguments

Verification by Testing for Recursive Program Schemes

Quasi-Ordered Structure in Highly Cross-Linked Poly(acrylamide) Gels

Norms on terms and their use in proving universal termination of a logic program

Mode Analysis Domains for Typed Logic Programs

A compositional semantics for logic programs

A method for specializing logic programs

Theoretical Design of Substituted Tetrathia-[7]-Helicenes with Large Second-Order Nonlinear Optical Responses

The Replacement Operation for CCP Programs

Specialising Finite Domain Programs Using Polyhedra

Transformation of Left Terminating Programs

Bisimulation and Unwinding for Verifying Possibilistic Security Properties

Algebraic Specification and Program Development by Stepwise Refinement

A microcalorimetric method for the evaluation of copper surface area in CuZnO catalyst

A multimembrane enzyme reactor operating in an electric field

Aktive Filter

Suchergebnisse filtern