Travelled to:1 × Belgium
1 × Brazil
1 × Denmark
1 × France
1 × Israel
1 × Portugal
1 × Spain
1 × The Netherlands
2 × Austria
2 × Canada
2 × Estonia
2 × Germany
2 × Hungary
2 × United Kingdom
3 × Italy
9 × USA
Collaborated with:P.A.Abdulla M.Nilsson Y.Tsay M.Saksena ∅ K.G.Larsen B.Steffen M.F.Atig T.Berg H.Raffelt A.Bouajjani S.Cassel F.Howar J.d'Orso C.Chilton L.Kempe W.Yi S.Nyström S.Aronis C.Leonardsson K.F.Sagonas Tuan Phong Ngo F.Aarts J.Uijen O.Wibling Z.Manna R.J.Waldinger E.Brinksma F.Orava C.Q.Trinh A.Bennaceur M.Isberner T.Chen M.Z.Kwiatkowska J.Blom A.Hessel P.Pettersson P.Mahata T.Touili M.Kindahl D.Peled K.Cerans F.Haziza L.Holík A.Rezine M.Merten O.Grinchtein M.Leucker Magnus Lång Konstantinos Sagonas
Talks about:model (13) regular (10) check (9) state (8) system (6) verif (6) infinit (5) specif (5) infer (5) stateless (4)
Person: Bengt Jonsson
DBLP: Jonsson:Bengt
Facilitated 5 volumes:
PrCoPrCoPrCoPrCoPrCoContributed to:
2015
2014
201420132013
20122012
2012
2011
2010
20082008
2007200620052004
20042003200220002000199919981998
199619951995
1994
1993199119891986
199119911995199620182016
20182019Wrote 42 papers:
- TACAS-2015-AbdullaAAJLS #model checking
- Stateless Model Checking for TSO and PSO (PAA, SA, MFA, BJ, CL, KFS), pp. 353–367.
- POPL-2014-AbdullaAJS #partial order #reduction
- Optimal dynamic partial order reduction (PAA, SA, BJ, KFS), pp. 373–384.
- SEFM-2014-CasselHJS #finite #learning #state machine
- Learning Extended Finite State Machines (SC, FH, BJ, BS), pp. 250–264.
- SEFM-2013-BennaceurCIJ #automation #behaviour #ontology #reasoning #synthesis
- Automated Mediator Synthesis: Combining Behavioural and Ontological Reasoning (AB, CC, MI, BJ), pp. 274–288.
- TACAS-2013-AbdullaHHJR #concurrent #data type #specification #verification
- An Integrated Specification and Verification Technique for Highly Concurrent Data Structures (PAA, FH, LH, BJ, AR), pp. 324–338.
- ESOP-2012-ChenCJK #behaviour #component #composition #specification
- A Compositional Specification Theory for Component Behaviours (TC, CC, BJ, MZK), pp. 148–168.
- TACAS-2012-MertenHSCJ #automaton #learning
- Demonstrating Learning of Register Automata (MM, FH, BS, SC, BJ), pp. 466–471.
- VMCAI-2012-HowarSJC #automaton #canonical
- Inferring Canonical Register Automata (FH, BS, BJ, SC), pp. 251–266.
- SFM-2011-Jonsson #automaton #learning #modelling
- Learning of Automata Models Extended with Data (BJ), pp. 327–349.
- ICTSS-2010-AartsJU #abstraction #communication #generative #infinity #modelling #protocol #using
- Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction (FA, BJ, JU), pp. 188–204.
- FASE-2008-BergJR #similarity #state machine #testing #using
- Regular Inference for State Machines Using Domains with Equality Tests (TB, BJ, HR), pp. 317–331.
- TACAS-2008-SaksenaWJ #ad hoc #graph grammar #modelling #protocol #verification
- Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols (MS, OW, BJ), pp. 18–32.
- CAV-2007-JonssonS #model checking
- Systematic Acceleration in Regular Model Checking (BJ, MS), pp. 131–144.
- FASE-2006-BergJR #parametricity #state machine
- Regular Inference for State Machines with Parameters (TB, BJ, HR), pp. 107–121.
- FASE-2005-BergGJLRS #consistency #on the #testing
- On the Correspondence Between Conformance Testing and Regular Inference (TB, OG, BJ, ML, HR, BS), pp. 175–189.
- CAV-2004-AbdullaJNdS #ltl #model checking
- Regular Model Checking for LTL(MSO) (PAA, BJ, MN, Jd, MS), pp. 348–360.
- FATES-2004-BlomHJP #automaton #generative #specification #testing #using
- Specifying and Generating Test Cases Using Observer Automata (JB, AH, BJ, PP), pp. 125–139.
- CAV-2003-AbdullaJNd #algorithm #model checking
- Algorithmic Improvements in Regular Model Checking (PAA, BJ, MN, Jd), pp. 236–248.
- CAV-2002-AbdullaJMd #model checking
- Regular Tree Model Checking (PAA, BJ, PM, Jd), pp. 555–568.
- CAV-2000-AbdullaJ #infinity #tutorial #verification
- Invited Tutorial: Verification of Infinite-State and Parameterized Systems (PAA, BJ), p. 4.
- CAV-2000-BouajjaniJNT #model checking
- Regular Model Checking (AB, BJ, MN, TT), pp. 403–418.
- TACAS-2000-JonssonN #infinity #transitive #verification
- Transitive Closures of Regular Relations for Verifying Infinite-State Systems (BJ, MN), pp. 220–234.
- CAV-1999-AbdullaBJN #verification
- Handling Global Conditions in Parameterized System Verification (PAA, AB, BJ, MN), pp. 134–145.
- CAV-1998-AbdullaBJ #analysis #bound #on the fly
- On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels (PAA, AB, BJ), pp. 305–318.
- CAV-1998-AbdullaJKP #approach #partial order #reduction #verification
- A General Approach to Partial Order Reductions in Symbolic Verification (PAA, BJ, MK, DP), pp. 379–390.
- TACAS-1998-AbdullaJ #network #process #verification
- Verifying Networks of Timed Processes (PAA, BJ), pp. 298–312.
- LICS-1996-AbdullaCJT #decidability #infinity #theorem
- General Decidability Theorems for Infinite-State Systems (PAA, KC, BJ, YKT), pp. 313–321.
- CAV-1995-JonssonK #algorithm #distributed #infinity #safety #verification
- Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms (BJ, LK), pp. 42–53.
- LICS-1995-JonssonY #composition #probability #process #testing
- Compositional Testing Preorders for Probabilistic Processes (BJ, WY), pp. 431–441.
- ICALP-1994-AbdullaJ #decidability #problem #source code #verification
- Undecidable Verification Problems for Programs with Unreliable Channels (PAA, BJ), pp. 316–327.
- ILPS-1993-NystromJ #concurrent #constraints #fixpoint #programming #semantics
- Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations (SON, BJ), pp. 335–352.
- LICS-1991-JonssonL #probability #process #refinement #specification
- Specification and Refinement of Probabilistic Processes (BJ, KGL), pp. 266–277.
- POPL-1989-Jonsson #data flow #network
- A Fully Abstract Trace Model for Dataflow Networks (BJ), pp. 155–165.
- LICS-1986-JonssonMW #data flow #deduction #network #synthesis #towards
- Towards Deductive Synthesis of Dataflow Networks (BJ, ZM, RJW), pp. 26–37.
- CAAP-1991-JonssonL #algebra #complexity #equation #on the #process
- On the Complexity of Equation Solving in Process Algebra (BJ, KGL), pp. 381–396.
- CCPSD-1991-BrinksmaJO #communication #interface
- Refining Interfaces of Communicating Systems (EB, BJ, FO), pp. 297–312.
- TAPSOFT-1995-JonssonT #linear #logic #specification
- Assumption/Guarantee Specifications in Linear-Time Temporal Logic (Extended Abstract) (BJ, YKT), pp. 262–276.
- TAPSOFT-J-1995-JonssonT96 #linear #logic #specification
- Assumption/Guarantee Specifications in Linear-Time Temporal Logic (BJ, YKT), pp. 47–72.
- ESOP-2018-AbdullaJT #abstraction #analysis #concurrent
- Fragment Abstraction for Concurrent Shape Analysis (PAA, BJ, CQT), pp. 442–471.
- CAV-2016-AbdullaAJL #model checking
- Stateless Model Checking for POWER (PAA, MFA, BJ, CL), pp. 134–156.
- OOPSLA-2018-AbdullaAJN #model checking #semantics
- Optimal stateless model checking under the release-acquire semantics (PAA, MFA, BJ, TPN), p. 29.
- OOPSLA-2019-AbdullaAJLNS #consistency #equivalence #model checking
- Optimal stateless model checking for reads-from equivalence under sequential consistency (PAA, MFA, BJ, ML, TPN, KS), p. 29.