Bengt Jonsson
#163,946
Most Influential Person Now
Bengt Jonsson's AcademicInfluence.com Rankings
Bengt Jonssoncomputer-science Degrees
Computer Science
#9668
World Rank
#10145
Historical Rank
Database
#6633
World Rank
#6868
Historical Rank
Download Badge
Computer Science
Bengt Jonsson's Degrees
- PhD Computer Science Uppsala University
Similar Degrees You Can Earn
Why Is Bengt Jonsson Influential?
(Suggest an Edit or Addition)Bengt Jonsson's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- A logic for reasoning about time and reliability (1990) (1342)
- General decidability theorems for infinite-state systems (1996) (478)
- Verifying programs with unreliable channels (1993) (390)
- Specification and refinement of probabilistic processes (1991) (360)
- Model-Based Testing of Reactive Systems, Advanced Lectures [The volume is the outcome of a research seminar that was held in Schloss Dagstuhl in January 2004] (2005) (359)
- Regular Model Checking (2000) (356)
- A calculus for communicating systems with time and probabilities (1990) (239)
- Algorithmic Analysis of Programs with Well Quasi-ordered Domains (2000) (206)
- Partial Order Reductions for Timed Systems (1998) (189)
- Optimal dynamic partial order reduction (2014) (177)
- Probabilistic Extensions of Process Algebras (2001) (174)
- A Survey of Regular Model Checking (2004) (146)
- Model-Based Testing of Reactive Systems: Advanced Lectures (Lecture Notes in Computer Science) (2005) (145)
- On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels (1998) (143)
- Model-Based Testing of Reactive Systems, Advanced Lectures (2005) (143)
- Stateless model checking for TSO and PSO (2015) (141)
- Generating models of infinite-state communication protocols using regular inference with abstraction (2010) (138)
- Undecidable Verification Problems for Programs with Unreliable Channels (1994) (122)
- Building timing predictable embedded systems (2014) (121)
- On the Correspondence Between Conformance Testing and Regular Inference (2005) (121)
- Transitive Closures of Regular Relations for Verifying Infinite-State Systems (2000) (121)
- A framework for reasoning about time and reliability (1989) (118)
- Probabilistic Process Algebra (2001) (113)
- Inferring Canonical Register Automata (2012) (111)
- Using Forward Reachability Analysis for Verification of Lossy Channel Systems (2004) (101)
- Active learning for extended finite state machines (2016) (101)
- Handling Global Conditions in Parameterized System Verification (1999) (98)
- Compositional testing preorders for probabilistic processes (1995) (98)
- Regular Tree Model Checking (2002) (96)
- Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs (1989) (93)
- Compositional specification and verification of distributed systems (1994) (91)
- A fully abstract trace model for dataflow networks (1989) (88)
- Model checking of systems with many identical timed processes (2003) (87)
- Learning of event-recording automata (2010) (79)
- Regular Inference for State Machines with Parameters (2006) (78)
- CONCUR ’94: Concurrency Theory (1994) (77)
- A model and proof system for asynchronous networks (1985) (72)
- Assumption/Guarantee Specifications in Linear-Time Temporal Logic (1996) (70)
- Regular Model Checking Made Simple and Efficient (2002) (69)
- Regular Inference for State Machines Using Domains with Equality Tests (2008) (69)
- Specifying and Generating Test Cases Using Observer Automata (2004) (69)
- Cyclic dependencies in modular performance analysis (2008) (69)
- Verifying Networks of Timed Processes (Extended Abstract) (1998) (69)
- Simulations Between Specifications of Distributed Systems (1991) (68)
- Insights to Angluin's Learning (2005) (68)
- Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols (2008) (65)
- Ensuring completeness of symbolic verification methods for infinite-state systems (2001) (60)
- Stateless Model Checking for POWER (2016) (60)
- Inference of Event-Recording Automata Using Timed Decision Trees (2006) (60)
- Using temporal logic for modular specification of telephone services (1994) (58)
- Testing and Refinement for Nondeterministic and Probabilistic Processes (1994) (53)
- A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention (2013) (53)
- Optimal stateless model checking under the release-acquire semantics (2018) (51)
- A Compositional Specification Theory for Component Behaviours (2012) (48)
- Correction to: An integrated specification and verification technique for highly concurrent data structures (2013) (47)
- A succinct canonical register automaton model (2011) (46)
- Incremental Requirement Specification for Evolving Systems (2001) (45)
- Processor Pipelines and Their Properties for Static WCET Analysis (2002) (45)
- Analysis of DTLS Implementations Using Protocol State Fuzzing (2020) (43)
- Algorithmic Improvements in Regular Model Checking (2003) (43)
- Inferring Semantic Interfaces of Data Structures (2012) (41)
- Testing preorders for probabilistic processes can be characterized by simulations (2002) (40)
- Refining Interfaces of Communicating Systems (1991) (39)
- CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems (2009) (39)
- Modular verification of asynchronous networks (1987) (39)
- Reasoning about Probabilistic Lossy Channel Systems (2000) (37)
- On Decomposing and Refining Specifications of Distributed Systems (1989) (36)
- Learning Extended Finite State Machines (2014) (35)
- Regular model checking for LTL(MSO) (2004) (35)
- RALib : A LearnLib extension for inferring EFSMs (2015) (33)
- A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract) (1998) (32)
- Optimal Dynamic Partial Order Reduction with Observers (2018) (31)
- State-space exploration for concurrent algorithms under weak memory orderings: (preliminary version) (2008) (30)
- Source Sets (2017) (30)
- On Handling Data in Automata Learning - Considerations from the CONNECT Perspective (2010) (29)
- Verification of heap manipulating programs with ordered data by extended forest automata (2013) (28)
- Learning of Automata Models Extended with Data (2011) (26)
- Optimal stateless model checking for reads-from equivalence under sequential consistency (2019) (26)
- An algebraic theory of interface automata (2014) (26)
- Combining Black-Box and White-Box Techniques for Learning Register Automata (2019) (25)
- Automated Mediator Synthesis: Combining Behavioural and Ontological Reasoning (2013) (24)
- Compositional assume-guarantee reasoning for input/output component theories (2014) (24)
- A modeling framework for reuse distance-based estimation of cache performance (2015) (24)
- Component-based Design and Integration Platforms (2003) (24)
- Verifying sequentially consistent memory (1994) (24)
- On the Complexity of Equation Solving in Process Algebra (1991) (23)
- An Execution Semantics for MSC-2000 (2001) (23)
- Implementing a Model Checking Algorithm by Adapting Existing Automated Tools (1989) (23)
- A fully abstract trace model for dataflow and asynchronous networks (1994) (22)
- Proving Liveness by Backwards Reachability (2006) (22)
- On the Existence of Network Invariants for Verifying Parameterized Systems (1999) (21)
- Proving refinement using transduction (1999) (21)
- Verifying Networks of Timed Processes (2006) (21)
- Inference of Timed Transition Systems (2005) (21)
- Generating online test oracles from temporal logic specifications (2003) (20)
- Automated test generation for industrial Erlang applications (2003) (20)
- Assume-Guarantee Reasoning for Safe Component Behaviours (2012) (19)
- Demonstrating Learning of Register Automata (2012) (18)
- Inferring Compact Models of Communication Protocol Entities (2010) (17)
- Simulating perfect channels with probabilistic lossy channels (2005) (17)
- Using SPIN to model check concurrent algorithms, using a translation from C to Promela (2009) (16)
- Multicore computing--the state of the art (2008) (15)
- Abstraction of Communication Channels in Promela: A Case Study (2000) (15)
- Comparing Two Fully Abstract Dataflow Models (1989) (14)
- A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations (2012) (14)
- Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations (1993) (13)
- Channel Representations in Protocol Verification (2001) (13)
- Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms (1995) (13)
- Maximal algebras of binary relations (1984) (12)
- Using refinement calculus techniques to prove linearizability (2012) (12)
- Specification and Validation of a Simple Overtaking Protokol using LOTOS (1991) (11)
- Extending Automata Learning to Extended Finite State Machines (2018) (11)
- Lock-free Contention Adapting Search Trees (2018) (11)
- A Hierarchy of Compositional Models of I/O-Automata (Extended Abstract) (1990) (11)
- Efficient Inter-Process Synchronization for Parallel Discrete Event Simulation on Multicores (2015) (10)
- Eliminating Queues from RT UML Model Representations (2002) (10)
- Assumption/Guarantee Specifications in Linear-Time Temporal Logic (Extended Abstract) (1995) (10)
- An Implementation of a Translational Semantics for an Imperative Language (1990) (10)
- An integrated specification and verification technique for highly concurrent data structures for highly concurrent data structures (2017) (9)
- Systematic Acceleration in Regular Model Checking (2007) (8)
- An integrated specification and verification technique for highly concurrent data structures (2016) (8)
- Exposing Inter-Process Information for Efficient Parallel Discrete Event Simulation of Spatial Stochastic Systems (2017) (8)
- Fully Abstract Characterization of Probabilistic May Testing (1999) (7)
- Extracting the process structure of Erlang applications (2001) (7)
- Modeling cache coherence misses on multicores (2014) (7)
- Industrial Evaluation of Test Suite Generation Strategies for Model-Based Testing (2016) (7)
- Fragment Abstraction for Concurrent Shape Analysis (2018) (7)
- Mediator Synthesis in a Component Algebra with Data (2015) (7)
- Replication Package for the paper (2018) (6)
- Specification for Verification (1989) (6)
- Automated Verification of Linearization Policies (2016) (6)
- Predicting the Cost of Lock Contention in Parallel Applications on Multicores using Analytic Modeling (2012) (6)
- Towards a Complete Hierarchy of Compositional Dataflow Models (1991) (6)
- Decidability of Timed Language-Inclusion for Networks of Real-Time Communicating Sequential Processes (1994) (6)
- A Formalization of Service Independent Building Blocks (1996) (5)
- A Constraint Programming Approach for Managing End-to-end Requirements in Sensor Network Macroprogramming (2014) (5)
- Formal design of communication protocols (1990) (4)
- Active learning for extended finite state machines (2016) (4)
- Exposing Inter-process Information for Efficient PDES of Spatial Stochastic Systems on Multicores (2019) (4)
- Validating Simulations Between Large Nondeterministic Specifications (1993) (4)
- Learning Mealy Machines with Timers (2017) (4)
- Regular model checking for LTL(MSO) (2011) (4)
- Stateless model checking for TSO and PSO (2016) (4)
- Part I. Testing of Finite State Machines (2004) (4)
- Comparing Source Sets and Persistent Sets for Partial Order Reduction (2017) (3)
- Towards Deductive Synthesis of Dataflow Networks (1986) (3)
- A Fully Abstract Semantics for Concurrent Constraint Programming (1998) (3)
- Channel Representations in Protocol Verification (Preliminary Version) (2001) (3)
- Initial CONNECT Architecture (2010) (2)
- Testing of Reactive Systems (2004) (2)
- Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (1996) (2)
- Forecasting Lock Contention Before Adopting Another Lock Algorithm (2015) (2)
- Building Tools for Creation and Analysis of Telephone Services y (1999) (2)
- A Case Study in Automated Detection of Service Interaction y (1999) (2)
- Generating models of infinite-state communication protocols using regular inference with abstraction (2014) (2)
- Automata-Based Automated Detection of State Machine Bugs in Protocol Implementations (2023) (1)
- Symbolic Backward Reachability with Summary Nodes for Graph Grammar Verification (2008) (1)
- Capturing functional and non-functional connector (2010) (1)
- DTLS-Fuzzer: A DTLS Protocol State Fuzzer (2022) (1)
- Formal methods and tools for the development of distributed and real time systems : Esprit Project 3096 (SPEC) (1990) (1)
- Lock-free Contention Adapting Search Trees (2021) (1)
- Formal Methods and Tools for the Development of Distributed and Real Time Systems: SPEC -- Esprit Project 3096 (Extended Abstract) (1990) (1)
- Creation of Dependent Features (2007) (1)
- Constraint Oriented Temporal Logic Specification (1994) (1)
- CONCUR '94: Concurrency Theory: 5th International Conference, Uppsala, Sweden, August 22 - 25, 1994. Proceedings (1994) (1)
- Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XI (1991) (1)
- Active Learning for Extended Finite State Machines 12 (2015) (1)
- Part II. Testing of Labeled Transition Systems (2004) (1)
- Fine-Grained Local Dynamic Load Balancing in PDES (2018) (1)
- Further development of learning techniques (2011) (1)
- Verification of heap manipulating programs with ordered data by extended forest automata (2015) (1)
- Part III. Model-Based Test Case Generation (2004) (1)
- Compositional Algebra of CONNECTors (2011) (1)
- Finite State Machines (2004) (1)
- 10051 Abstracts Collection - Quantitative and Qualitative Analysis of Network Protocols (2010) (0)
- onASTEC : an experience in the establishment of collaboration between academia and industry (2003) (0)
- Subjects T1: Testing of Finite State Machines (5 Chapters) T2: Preorder-based Testing of Labeled Transition Systems (5 Chap- Ters) (0)
- Analyzing Failure Effects and Recovery in ERLANG / OTP systems Project Participants Project manager ? (2002) (0)
- Multicore computingthe state of the art (2008) (0)
- On bisimulation in the pi-calculus (1994) (0)
- Rephrasing interoperability in terms of connector behaviours (2012) (0)
- Potential Master's and Ph.D. Thesis Projects (2011) (0)
- Integration into the CONNECT Architecture (2020) (0)
- Automated Verification of Concurrent Programs (2009) (0)
- Invited Tutorial: Verification of Infinite-State and Parameterized Systems (2000) (0)
- Applying Symbolic Execution to Test Implementations of a Network Protocol Against its Specification (2022) (0)
- Using refinement calculus techniques to prove linearizability (2012) (0)
- Seminars on Learning and Testing (2006) (0)
- ICT FET IP Project Deliverable D4.1 Establishing basis for learning algorithms (2010) (0)
- Proceedings of the Concurrency Theory (1994) (0)
- Testing of Timed Systems (2006) (0)
- A Divide-and-Conquer Strategy for Regular Model Checking (2007) (0)
- Consistency and Persistency in Program Verification: Challenges and Opportunities (2022) (0)
- 10051 Executive Summary - Quantitative and Qualitative Analysis of Network Protocols (2010) (0)
- Symbolic Testing of Erlang Programs (2006) (0)
- Quantitative and Qualitative Analysis of Network Protocols Dagstuhl Seminar (2010) (0)
- Learning of Reactive Systems (2006) (0)
- Verifying Safety Propert ies of a Class of Inf inite-State Dis tr ibuted Algor i thms * (2005) (0)
- Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial) (2019) (0)
- Protocol Specification, Testing and Verification XI, Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification, Stockholm, Sweden, 18-20 June 1991 (1991) (0)
- Guest Editors Foreword (1995) (0)
- Preface by the section editors (2003) (0)
- Algorithmi Improvements in Regular ModelChe king ? (2007) (0)
- Part VII. Appendices (2004) (0)
- Correction to: An integrated specification and verification technique for highly concurrent data structures (2021) (0)
- Insights to {A}ngluin's Learning (2003) (0)
- Part V. Standardized Test Notation and Execution Architecture (2004) (0)
- Part VI. Beyond Testing (2004) (0)
- Model-Based Testing of Reactive Systems, Advanced Lectures : outcome of a research seminar (2005) (0)
- Regular Tree Model Che kingParosh (2007) (0)
- G En Eratin G M Od Els O F in Fin Ite-s Ta Te C Om M U N Ication P Ro to Co Ls U Sin G R Egular Inference W Ith a B Straction* (2016) (0)
- Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens (2022) (0)
- Part IV. Tools and Case Studies (2004) (0)
- Report on Dataflow Dependencies in Billing Processing Systems (2004) (0)
- Computer Systems: Publications (2008) (0)
- Channel Abstractions in Protocol Verification (2001) (0)
- Fonnal Methods and Tools for the Development of Distributed and Real Time Systems Computing Science Notes Formal Methods and Tools for the Development of Distributed and Real Time Systems * Spec -esprit Project 3096 (2001) (0)
- QD An Algebraic Theory of Interface Automata (2013) (0)
- ASTEC: An Experience in the Establishment of Collaboration between Academia and Industry (2003) (0)
- Modeling and Automated Veri cation of AuthenticationProtocolsParosh (2007) (0)
- Recent Trends in Program Analysis, Verification, and Testing (2006) (0)
- Project Plan : Process structure extraction from ERLANG / OTP systems Project Participants Project manager ? % (2001) (0)
- Automatic Testing of a WAP Gateway (2006) (0)
- Using Refinement Calculus Techniques to Prove Linearizability 1 (2013) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Bengt Jonsson?
Bengt Jonsson is affiliated with the following schools:
