Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783662488980, 9783662488997

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Analyzing Internet Routing Security Using Model Checking

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-662-48899-7_9 ◽

2015 ◽

pp. 112-129 ◽

Cited By ~ 2

Author(s):

Adi Sosnovich ◽

Orna Grumberg ◽

Gabi Nakibly

Keyword(s):

Model Checking ◽

Internet Routing ◽

Routing Security

Download Full-text

Abstract Domains and Solvers for Sets Reasoning

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-662-48899-7_25 ◽

2015 ◽

pp. 356-371

Author(s):

Arlen Cox ◽

Bor-Yuh Evan Chang ◽

Huisong Li ◽

Xavier Rival

Keyword(s):

Abstract Domains

Download Full-text

On CTL* with Graded Path Modalities

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-662-48899-7_20 ◽

2015 ◽

pp. 281-296 ◽

Cited By ~ 2

Author(s):

Benjamin Aminof ◽

Aniello Murano ◽

Sasha Rubin

Download Full-text

An Adequate Compositional Encoding of Bigraph Structure in Linear Logic with Subexponentials

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-662-48899-7_11 ◽

2015 ◽

pp. 146-161 ◽

Cited By ~ 1

Author(s):

Kaustuv Chaudhuri ◽

Giselle Reis

Keyword(s):

Linear Logic

Download Full-text

Verification of Concurrent Programs Using Trace Abstraction Refinement

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-662-48899-7_17 ◽

2015 ◽

pp. 233-248 ◽

Cited By ~ 3

Author(s):

Franck Cassez ◽

Frowin Ziegler

Keyword(s):

Concurrent Programs ◽

Abstraction Refinement

Download Full-text

Reasoning About Embedded Dependencies Using Inclusion Dependencies

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-662-48899-7_2 ◽

2015 ◽

pp. 16-30 ◽

Cited By ~ 4

Author(s):

Miika Hannula

Download Full-text

Using Program Synthesis for Program Analysis

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-662-48899-7_34 ◽

2015 ◽

pp. 483-498 ◽

Cited By ~ 8

Author(s):

Cristina David ◽

Daniel Kroening ◽

Matt Lewis

Keyword(s):

Program Analysis ◽

Program Synthesis

Download Full-text

Automated Discovery of Simulation Between Programs

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-662-48899-7_42 ◽

2015 ◽

pp. 606-621 ◽

Cited By ~ 12

Author(s):

Grigory Fedyukovich ◽

Arie Gurfinkel ◽

Natasha Sharygina

Keyword(s):

Automated Discovery

Download Full-text

Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-662-48899-7_15 ◽

2015 ◽

pp. 203-218 ◽

Cited By ~ 4

Author(s):

Patrick Baillot ◽

Gilles Barthe ◽

Ugo Dal Lago

Keyword(s):

Computational Complexity ◽

Implicit Computational Complexity

Download Full-text

On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-662-48899-7_21 ◽

2015 ◽

pp. 297-312

Author(s):

Chuck Liang ◽

Dale Miller

Keyword(s):

Multi Level

Download Full-text

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Analyzing Internet Routing Security Using Model Checking

Abstract Domains and Solvers for Sets Reasoning

On CTL* with Graded Path Modalities

An Adequate Compositional Encoding of Bigraph Structure in Linear Logic with Subexponentials

Verification of Concurrent Programs Using Trace Abstraction Refinement

Reasoning About Embedded Dependencies Using Inclusion Dependencies

Using Program Synthesis for Program Analysis

Automated Discovery of Simulation Between Programs

Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs

On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science
Latest Publications