Travelled to:1 × Finland
1 × France
1 × Israel
1 × Japan
1 × Poland
1 × Russia
1 × Sweden
2 × Austria
2 × Denmark
2 × Estonia
2 × Greece
2 × Italy
2 × Spain
3 × Canada
3 × Hungary
3 × The Netherlands
4 × Portugal
5 × Germany
5 × United Kingdom
6 × USA
Collaborated with:G.Behrmann B.Nielsen ∅ A.David J.I.Rasmussen A.Wasowski S.Li P.Pettersson W.Yi M.Mikucionis U.Nyman B.Jonsson L.Xinxin A.Skou P.Bouyer K.J.Kristoffersen R.Pelánek C.Weise S.Pusinskas U.Fahrenberg K.Havelund B.Thomsen R.Milner J.Srba E.Fleury P.G.Jensen H.R.Andersen H.Hulgaard J.Lind-Nielsen J.Bengtsson F.Larsson D.Gebler S.Tini S.Kupferschmid J.Hoffmann N.Markey U.Larsen K.Subramani L.Aceto A.Burgueño B.Steffen K.Cerans J.C.Godskesen U.Holmer A.Legay G.Bacci G.Bacci R.Mardare N.Benes P.Bezdek J.H.Andersen J.Niedermann J.H.Taankvist A.Laarman M.C.Olesen A.E.Dalsgaard J.v.d.Pol U.H.Hjort M.A.Petersen A.Antonik M.Huth G.Díaz J.J.Pardo F.Cuartero V.Valero A.Hessel J.Pearson F.Laroussinie W.Y.0001 F.M.Bønneland M.Muñiz A.Cougnard D.Lime S.S.Bauer R.Hennicker P.E.Bulychev D.B.Poulsen Z.Wang E.Brinksma A.Fehnker T.Hune J.Romijn W.O.D.Griffioen
Talks about:time (31) automata (13) uppaal (12) system (12) use (12) real (10) test (9) base (8) model (7) check (7)
Person: Kim Guldstrand Larsen
DBLP: Larsen:Kim_Guldstrand
Facilitated 5 volumes:
Ed
Ed
Ed
EdEdContributed to:
2015201520152013
2013
2012
2012
2010
2009
2009200920082008
200820082007
200720072007200620052005
2005
2004
2004
2004200420032003200320011999199919981997199619961995199519931993199219911991
199119901990
1989198819871985
199119972018Wrote 58 papers:
- FoSSaCS-2015-BacciBLM #distance #markov #on the
- On the Total Variation Distance of Semi-Markov Chains (GB, GB, KGL, RM), pp. 185–199.
- FoSSaCS-2015-GeblerLT #calculus #composition #metric #probability #process #reasoning
- Compositional Metric Reasoning with Probabilistic Process Calculi (DG, KGL, ST), pp. 230–245.
- ICALP-v2-2015-BenesBLS #automaton #parametricity
- Language Emptiness of Continuous-Time Parametric Timed Automata (NB, PB, KGL, JS), pp. 69–81.
- TACAS-2015-DavidJLMT #stratego
- Uppaal Stratego (AD, PGJ, KGL, MM, JHT), pp. 206–211.
- CAV-2013-LaarmanODLP #abstraction #automaton #manycore #using
- Multi-core Emptiness Checking of Timed Büchi Automata Using Inclusion Abstraction (AL, MCO, AED, KGL, JvdP), pp. 968–983.
- IFM-2013-Larsen #automaton #model checking #statistics
- Priced Timed Automata and Statistical Model Checking (KGL), pp. 154–161.
- FASE-2012-BauerDHLLNW #component #contract #design #specification
- Moving from Specifications to Contracts in Component-Based Design (SSB, AD, RH, KGL, AL, UN, AW), pp. 43–58.
- QAPL-2012-BulychevDLMPLW #automaton #model checking #named #statistics
- UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata (PEB, AD, KGL, MM, DBP, AL, ZW), pp. 1–16.
- DATE-2010-LarsenLNP #analysis #realtime #synthesis #using
- Scenario-based analysis and synthesis of real-time systems using uppaal (KGL, SL, BN, SP), pp. 447–452.
- FM-2009-HjortRLPS #modelling #testing #user interface #using
- Model-Based GUI Testing Using Uppaal at Novo Nordisk (UHH, JIR, KGL, MAP, AS), pp. 814–818.
- FM-2009-LarsenLNP #realtime #requirements #verification
- Verifying Real-Time Systems against Scenario-Based Requirements (KGL, SL, BN, SP), pp. 676–691.
- ICST-2009-DavidLLN #testing
- Timed Testing under Partial Observability (AD, KGL, SL, BN), pp. 61–70.
- QAPL-2009-FahrenbergL09a
- Discounting in Time (UF, KGL), pp. 25–31.
- DATE-2008-DavidLLN #approach #game studies #realtime #testing
- A Game-Theoretic Approach to Real-Time System Testing (AD, KGL, SL, BN), pp. 486–491.
- FoSSaCS-2008-AntonikHLNW #complexity #problem #specification
- Complexity of Decision Problems for Mixed and Modal Specifications (AA, MH, KGL, UN, AW), pp. 112–126.
- MBT-2008-DavidLLN #testing
- Cooperative Testing of Timed Systems (AD, KGL, SL, BN), pp. 79–92.
- TACAS-2008-KupferschmidHL #abstraction #model checking #performance
- Fast Directed Model Checking Via Russian Doll Abstraction (SK, JH, KGL), pp. 203–217.
- CAV-2007-BehrmannCDFLL #exclamation #game studies #named
- UPPAAL-Tiga: Time for Playing Games! (GB, AC, AD, EF, KGL, DL), pp. 121–125.
- ESOP-2007-LarsenNW #automaton #interface #product line
- Modal I/O Automata for Interface and Product Line Theories (KGL, UN, AW), pp. 64–79.
- FoSSaCS-2007-BouyerLM #automaton #model checking
- Model-Checking One-Clock Priced Timed Automata (PB, KGL, NM), pp. 108–122.
- TACAS-2007-RasmussenBL #complexity #flexibility
- Complexity in Simplicity: Flexible Agent-Based State Space Exploration (JIR, GB, KGL), pp. 231–245.
- FM-2006-LarsenNW #automaton #interface
- Interface Input/Output Automata (KGL, UN, AW), pp. 82–97.
- FASE-2005-LarsenLW #source code #specification
- Color-Blind Specifications for Transformations of Reactive Synchronous Programs (KGL, UL, AW), pp. 160–174.
- FoSSaCS-2005-LarsenR #automaton #multi #reachability
- Optimal Conditional Reachability for Multi-priced Timed Automata (KGL, JIR), pp. 234–249.
- SAC-2005-DiazLPCV #approach #behaviour #e-commerce #probability #protocol #realtime #set #validation
- An approach to handle real time and probabilistic behaviors in e-commerce: validating the SET protocol (GD, KGL, JJP, FC, VV), pp. 815–820.
- ASE-2004-MikucionisLN #modelling #named #online #realtime #testing
- T-UPPAAL: Online Model-based Testing of Real-Time Systems (MM, KGL, BN), pp. 396–397.
- FATES-2004-LarsenMN #online #realtime #testing #using
- Online Testing of Real-time Systems Using Uppaal (KGL, MM, BN), pp. 79–94.
- SFM-2004-BehrmannDL #tutorial
- A Tutorial on Uppaal (GB, AD, KGL), pp. 200–236.
- TACAS-2004-BehrmannBLP #abstraction #automaton #bound
- Lower and Upper Bounds in Zone Based Abstractions of Timed Automata (GB, PB, KGL, RP), pp. 312–326.
- TACAS-2004-RasmussenLS #automaton #scheduling #using
- Resource-Optimal Scheduling Using Priced Timed Automata (JIR, KGL, KS), pp. 220–235.
- CAV-2003-BehrmannLP
- To Store or Not to Store (GB, KGL, RP), pp. 433–445.
- FATES-2003-HesselLNPS #generative #realtime #testing #using
- Time-Optimal Real-Time Test Case Generation Using Uppaal (AH, KGL, BN, PP, AS), pp. 114–130.
- TACAS-2003-BehrmannBFL #analysis #automaton #verification
- Static Guard Analysis in Timed Automata Verification (GB, PB, EF, KGL), pp. 254–277.
- CAV-2001-LarsenBBFHPR #automaton #performance #reachability
- As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata (KGL, GB, EB, AF, TH, PP, JR), pp. 493–505.
- CAV-1999-BehrmannLPWY #analysis #diagrams #difference #performance #reachability #using
- Efficient Timed Reachability Analysis Using Clock Difference Diagrams (GB, KGL, JP, CW, WY), pp. 341–353.
- TACAS-1999-BehrmannLAHL #composition #reuse #usability #using #verification
- Verification of Hierarchical State/Event Systems Using Reusability and Compositionality (GB, KGL, HRA, HH, JLN), pp. 163–177.
- TACAS-1998-AcetoBL #automaton #model checking #reachability #testing
- Model Checking via Reachability Testing for Timed Automata (LA, AB, KGL), pp. 263–280.
- TACAS-1998-Lind-NielsenABHKL #analysis #composition #dependence #scalability #using #verification
- Verification of Large State/Event Systems Using Compositionality and Dependency Analysis (JLN, HRA, GB, HH, KJK, KGL), pp. 201–216.
- CAV-1997-LarsenPY #named
- UPPAAL: Status & Developments (KGL, PP, WY), pp. 456–459.
- CAV-1996-BengtssonGKLLPY #protocol #using #verification
- Verification of an Audio Protocol with Bus Collision Using UPPAAL (JB, WODG, KJK, KGL, FL, PP, WY), pp. 244–256.
- TACAS-1996-BengtssonLLPY
- UPPAAL in 1995 (JB, KGL, FL, PP, WY), pp. 431–434.
- ICALP-1995-AndersenKLN #automation #realtime #synthesis
- Automatic Synthesis of Real Time Systems (JHA, KJK, KGL, JN), pp. 535–546.
- TACAS-1995-LarsenSW #constraints #proving
- A Constraint Oriented Proof Methodology Based on Modal Transition Systems (KGL, BS, CW), pp. 17–40.
- CAV-1993-CeransGL #specification #tool support
- Timed Modal Specification — Theory and Tools (KC, JCG, KGL), pp. 253–267.
- ICALP-1993-HavelundL #calculus
- The Fork Calculus (KH, KGL), pp. 544–557.
- CAV-1992-Larsen #correctness #performance
- Efficient Local Correctness Checking (KGL), pp. 30–43.
- CAV-1991-HolmerLY #process #realtime
- Deciding Properties of Regular Real Time Processes (UH, KGL, WY), pp. 443–453.
- ICALP-1991-Larsen #power of #specification
- The Expressive Power of Implicit Specifications (KGL), pp. 204–216.
- LICS-1991-JonssonL #probability #process #refinement #specification
- Specification and Refinement of Probabilistic Processes (BJ, KGL), pp. 266–277.
- ICALP-1990-LarsenX #composition #semantics
- Compositionality Through an Operational Semantics of Contexts (KGL, LX), pp. 526–539.
- LICS-1990-LarsenX #equation #using
- Equation Solving Using Modal Transition Systems (KGL, LX), pp. 108–117.
- POPL-1989-LarsenS #bisimulation #probability #testing
- Bisimulation Through Probabilistic Testing (KGL, AS), pp. 344–352.
- LICS-1988-LarsenT #logic #process
- A Modal Process Logic (KGL, BT), pp. 203–210.
- ICALP-1987-LarsenM #bisimulation #protocol #using #verification
- Verifying a Protocol Using Relativized Bisimulation (KGL, RM), pp. 126–135.
- ICALP-1985-Larsen #equivalence #process
- A Context Dependent Equivalence between Processes (KGL), pp. 373–382.
- CAAP-1991-JonssonL #algebra #complexity #equation #on the #process
- On the Complexity of Equation Solving in Process Algebra (BJ, KGL), pp. 381–396.
- TAPSOFT-1997-KristoffersenLLPY #composition #protocol #proving #realtime
- A Compositional Proof of a Real-Time Mutual Exclusion Protocol (KJK, FL, KGL, PP, WY0), pp. 565–579.
- CAV-2018-BonnelandJLMS #partial order #reduction
- Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems (FMB, PGJ, KGL, MM, JS), pp. 527–546.