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

Model checking of safety-critical software in the nuclear engineering domain

Reliability engineering & system safety, 2012-09, Vol.105, p.104-113

2012

Volltextzugriff (PDF)

Efficient model checking of PSL safety properties

IET computers & digital techniques, 2011-11, Vol.5 (6), p.479-479

2011

Volltextzugriff (PDF)

ViraPipe: scalable parallel pipeline for viral metagenome analysis from next generation sequencing reads

Bioinformatics, 2018-03, Vol.34 (6), p.928-935

2018

Volltextzugriff (PDF)

Simple Bounded LTL Model Checking

Formal Methods in Computer-Aided Design, 2004, p.186-200

2004

Volltextzugriff (PDF)

Complexity results for checking distributed implementability

Fifth International Conference on Application of Concurrency to System Design (ACSD'05), 2005, p.78-87

2005

Volltextzugriff (PDF)

Bounded LTL model checking with stable models

Theory and practice of logic programming, 2003-07, Vol.3 (4-5), p.519-550

2003

Volltextzugriff (PDF)

Simple is better: efficient bounded model checking for past LTL

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

2005

Volltextzugriff (PDF)

Specification coverage aided test selection

Third International Conference on Application of Concurrency to System Design, 2003. Proceedings, 2003, p.187-195

2003

Volltextzugriff (PDF)

Improving Dynamic Partial Order Reductions for Concolic Testing

2012 12th International Conference on Application of Concurrency to System Design, 2012, p.132-141

2012

Volltextzugriff (PDF)

Model checking of safety-critical software in the nuclear engineering domain: ESREL 2010

Reliability engineering & system safety, 2012, Vol.105, p.104-113

2012

Volltextzugriff (PDF)

Incremental and Complete Bounded Model Checking for Full PLTL

Computer Aided Verification, 2005, p.98-111

2005

Volltextzugriff (PDF)

Efficient model checking of PSL safety properties: Selected papers from the 10th International Conference on Application of Concurrency to System Design (ACSD 2010)

IET computers & digital techniques, 2011, Vol.5 (6), p.479-492

2011

Volltextzugriff (PDF)

Unfoldings: A Partial-Order Approach to Model Checking

1. Aufl., 2008

Volltextzugriff (PDF)

Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets

Lecture notes in computer science, 1999, p.240-254

1999

Volltextzugriff (PDF)

Testing Spin’s LTL Formula Conversion into Büchi Automata with Randomly Generated Input

Lecture notes in computer science, 2000, p.54-72

2000

Volltextzugriff (PDF)

Parallelisation of the Petri Net Unfolding Algorithm

Lecture notes in computer science, 2002, p.371-385

2002

Volltextzugriff (PDF)

A New Unfolding Approach to LTL Model Checking

Automata, Languages and Programming, 2000, p.475-486

2000

Volltextzugriff (PDF)

Using unfoldings in automated testing of multithreaded programs

2012 Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering, 2012, p.150-159

2012

Volltextzugriff (PDF)

Prod 3.2 An advanced tool for efficient reachability analysis

Computer Aided Verification, 2005, p.472-475

2005

Volltextzugriff (PDF)

Model Checking with Finite Complete Prefixes Is PSPACE-Complete

CONCUR 2000 — Concurrency Theory, 2000, p.108-122

2000

Volltextzugriff (PDF)

Reporting Races in Dynamic Partial Order Reduction

NASA Formal Methods, p.450-456

Volltextzugriff (PDF)

Model Checking Software: 8th International SPIN Workshop, Toronto, Canada, May 19-20, 2001 Proceedings

Dwyer, Matthew

1, 2001

Volltextzugriff (PDF)

1 – 22 von 22

Menü

Weitere Dienste

Einstellungen

Model checking of safety-critical software in the nuclear engineering domain

Efficient model checking of PSL safety properties

ViraPipe: scalable parallel pipeline for viral metagenome analysis from next generation sequencing reads

Simple Bounded LTL Model Checking

Complexity results for checking distributed implementability

Bounded LTL model checking with stable models

Simple is better: efficient bounded model checking for past LTL

Specification coverage aided test selection

Improving Dynamic Partial Order Reductions for Concolic Testing

Model checking of safety-critical software in the nuclear engineering domain: ESREL 2010

Incremental and Complete Bounded Model Checking for Full PLTL

Efficient model checking of PSL safety properties: Selected papers from the 10th International Conference on Application of Concurrency to System Design (ACSD 2010)

Unfoldings: A Partial-Order Approach to Model Checking

Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets

Testing Spin’s LTL Formula Conversion into Büchi Automata with Randomly Generated Input

Parallelisation of the Petri Net Unfolding Algorithm

A New Unfolding Approach to LTL Model Checking

Using unfoldings in automated testing of multithreaded programs

Prod 3.2 An advanced tool for efficient reachability analysis

Model Checking with Finite Complete Prefixes Is PSPACE-Complete

Reporting Races in Dynamic Partial Order Reduction

Model Checking Software: 8th International SPIN Workshop, Toronto, Canada, May 19-20, 2001 Proceedings

Suchergebnisse filtern