( en | de | ru )

 

Disambiguation of "Larsen, Kim Guldstrand"

Author of the publication

copydeleteadd this publication to your clipboard
Elimination of Detached Regions in Dependency Graph Verification.

, , , and . SPIN, volume 13872 of Lecture Notes in Computer Science, page 163-179. Springer, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Reinhard Larsen

Jürgen Larsen

Patrick Larsen

Claudia Larsen

Larsen Schütte

 

Other publications of authors with the same name

CMC: A Tool for Compositional Model-Checking of Real-Time Systems., and . FORTE, volume 135 of IFIP Conference Proceedings, page 439-456. Kluwer, (1998)Parametric and Quantitative Extensions of Modal Transition Systems., , , and . FPS@ETAPS, volume 8415 of Lecture Notes in Computer Science, page 84-97. Springer, (2014)Diagnostic Model-Checking for Real-Time Systems., , and . Hybrid Systems, volume 1066 of Lecture Notes in Computer Science, page 575-586. Springer, (1995)Compositionality Through an Operational Semantics of Contexts., and . ICALP, volume 443 of Lecture Notes in Computer Science, page 526-539. Springer, (1990)The Fork Calculus., and . ICALP, volume 700 of Lecture Notes in Computer Science, page 544-557. Springer, (1993)A Context Dependent Equivalence between Processes.. ICALP, volume 194 of Lecture Notes in Computer Science, page 373-382. Springer, (1985)Efficient Local Correctness Checking.. CAV, volume 663 of Lecture Notes in Computer Science, page 30-43. Springer, (1992)Almost Optimal Strategies in One Clock Priced Timed Games., , , and . FSTTCS, volume 4337 of Lecture Notes in Computer Science, page 345-356. Springer, (2006)Optimal Strategies in Priced Timed Game Automata., , , and . FSTTCS, volume 3328 of Lecture Notes in Computer Science, page 148-160. Springer, (2004)Optimal Conditional Reachability for Multi-priced Timed Automata., and . FoSSaCS, volume 3441 of Lecture Notes in Computer Science, page 234-249. Springer, (2005)