Construction and SAT-Based Verification of Contextual Unfoldings

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-22600-7_3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

SAT-Based Compositional Verification Using Lazy Learning

English

Modular Construction of Finite and Complete Prefixes of Petri Net Unfoldings

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

Extending Coq With Imperative Features and Its Application to SAT Verification

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Set-Based SAT-solving

Facta universitatis - series: Electronics and Energetics
2007English

Dependability Verification for Contextual/Runtime Goal Modelling

English

Contextual Affect Analysis: A System for Verification of Emotion Appropriateness Supported With Contextual Valence Shifters

International Journal of Biometrics
Electronic EngineeringPattern RecognitionApplied MathematicsComputer VisionComputer Science ApplicationsElectrical
2010English

The Constraints, Construction, and Verification of a Strain-Specific Physiologically Based Pharmacokinetic Rat Model

Journal of Pharmaceutical Sciences
Pharmaceutical Science
2017English

Normal Forms and Unfoldings of Singular Strategy Functions

Dynamic Games and Applications
Computer GraphicsProbabilityStatisticsApplied MathematicsMathematicsComputer Science ApplicationsComputer-Aided DesignComputational TheoryComputational Mathematics
2014English

Specification-Based Program Repair Using SAT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy