The following pages link to Bengt Jonsson (Q300410):
Displaying 50 items.
- (Q197800) (redirect page) (← links)
- Verification of heap manipulating programs with ordered data by extended forest automata (Q300414) (← links)
- An algebraic theory of interface automata (Q402131) (← links)
- A succinct canonical register automaton model (Q478388) (← links)
- Learning of event-recording automata (Q604474) (← links)
- Assumption/guarantee specifications in linear-time temporal logic (Q671674) (← links)
- Undecidable verification problems for programs with unreliable channels (Q675223) (← links)
- Active learning for extended finite state machines (Q736459) (← links)
- A fully abstract semantics for concurrent constraint programming (Q1275748) (← links)
- Deciding bisimulation equivalences for a class of non-finite-state programs (Q1317428) (← links)
- A fully abstract trace model for dataflow and asynchronous networks (Q1333374) (← links)
- A logic for reasoning about time and reliability (Q1343864) (← links)
- Testing preorders for probabilistic processes can be characterized by simulations (Q1603706) (← links)
- Stateless model checking for TSO and PSO (Q1683934) (← links)
- Simulating perfect channels with probabilistic lossy channels (Q1776399) (← links)
- Model checking of systems with many identical timed processes (Q1853589) (← links)
- Algorithmic analysis of programs with well quasi-ordered domains. (Q1854355) (← links)
- Using forward reachability analysis for verification of lossy channel systems (Q1878928) (← links)
- Verifying programs with unreliable channels (Q1923094) (← links)
- Using refinement calculus techniques to prove linearizability (Q1941870) (← links)
- Generating models of infinite-state communication protocols using regular inference with abstraction (Q2018056) (← links)
- Combining black-box and white-box techniques for learning register automata (Q2075785) (← links)
- Fragment abstraction for concurrent shape analysis (Q2323989) (← links)
- Optimal dynamic partial order reduction with observers (Q2324230) (← links)
- (Q2736352) (← links)
- (Q2743709) (← links)
- (Q2753761) (← links)
- (Q2754102) (← links)
- (Q2760248) (← links)
- (Q2779792) (← links)
- (Q2849548) (← links)
- (Q2851066) (← links)
- Inferring Canonical Register Automata (Q2891417) (← links)
- A Compositional Specification Theory for Component Behaviours (Q2892725) (← links)
- Demonstrating Learning of Register Automata (Q2894291) (← links)
- A Succinct Canonical Register Automaton Model (Q3172926) (← links)
- (Q3359755) (← links)
- Mediator Synthesis in a Component Algebra with Data (Q3449636) (← links)
- (Q4028636) (← links)
- (Q4439599) (← links)
- (Q4470509) (← links)
- (Q4484482) (← links)
- (Q4518896) (← links)
- (Q4536611) (← links)
- Undecidable verification problems for programs with unreliable channels (Q4632436) (← links)
- Source Sets (Q4640276) (← links)
- A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations (Q4649287) (← links)
- (Q4791827) (← links)
- (Q4804925) (← links)
- (Q4817539) (← links)