ChangeDetection - Change Log: Logical Methods in Computer Science

Logical Methods in Computer Science

Current status: normal - monitoring
Number of users monitoring this page: 1
Most recent sizable change (text, html) : 2012-01-19 21:05
Most recent change (text, html) : 2012-01-19 21:05
Last checked for changes: 2012-02-13 21:39
ChangeDetection started monitoring: 2008-04-25 21:05

monitor this page

summary of most recent changes

Showing 1 - 5 of 25

1 2 3 4 [next]

show added and deleted only added only deleted | show context hide context | show sizable show all

View changes: 2012-01-19 21:05 22 new words, 19 deleted words, 18% change

... SUPPORT CONTACT RECENTLY PUBLISHED Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis Assalé Adjé, Stéphane Gaubert and Eric Goubault Complexity of Model Checking ... Lee and Benjamin Werner Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads Mohamed Faouzi Atig, Ahmed Bouajjani and Shaz Qadeer Logical Methods in Computer ... SUPPORT CONTACT RECENTLY PUBLISHED Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis Assalé Adjé, Stéphane Gaubert and Eric Goubault Complexity of Model Checking ... Logical Methods in Computer SUPPORT CONTACT RECENTLY PUBLISHED ... Lee and Benjamin Werner Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads Mohamed Faouzi Atig, Ahmed Bouajjani and Shaz Qadeer Logical Methods in Computer more...

View changes: 2012-01-18 21:05 21 new words, 13 deleted words, 15% change

... SUPPORT CONTACT RECENTLY PUBLISHED Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus Naoki Kobayashi and C.-H. Luke Ong Timed Parity Games: ... Bouajjani and Shaz Qadeer A decidable characterization of locally testable tree languages Thomas Place and Luc Segoufin Logical Methods in Computer SUPPORT CONTACT RECENTLY PUBLISHED Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus Naoki Kobayashi and C.-H. Luke Ong Timed Parity Games: ... Logical Methods in Computer SUPPORT CONTACT RECENTLY PUBLISHED ... Bouajjani and Shaz Qadeer A decidable characterization of locally testable tree languages Thomas Place and Luc Segoufin Logical Methods in Computer

View changes: 2011-12-14 21:05 31 new words, 30 deleted words, 27% change

... SUPPORT CONTACT RECENTLY PUBLISHED Timed Parity Games: Complexity and Robustness Krishnendu Chatterjee, Thomas A Henzinger and Vinayak S Prabhu A note on the expressive power of linear orders Thomas Schwentick and Nicole Schweikardt The Complexity of Rooted ... Place and Luc Segoufin The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function Vassilios Gregoriades Computational Models of Certain Hyperspaces of Quasi-metric Spaces Massoud Pourmahdian and Mahdi Ali-Akbari ... SUPPORT CONTACT RECENTLY PUBLISHED Timed Parity Games: Complexity and Robustness Krishnendu Chatterjee, Thomas A Henzinger and Vinayak S Prabhu A note on the expressive power of linear orders Thomas Schwentick and Nicole Schweikardt The Complexity of Rooted ... Logical Methods in Computer SUPPORT CONTACT RECENTLY PUBLISHED ... Place and Luc Segoufin The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function Vassilios Gregoriades Computational Models of Certain Hyperspaces of Quasi-metric Spaces Massoud Pourmahdian and Mahdi Ali-Akbari Logical Methods in Computer more...

View changes: 2011-11-24 21:05 13 new words, 13 deleted words, 12% change

... SUPPORT CONTACT RECENTLY PUBLISHED The Complexity of Rooted Phylogeny Problems Manuel Bodirsky and Jens K. Mueller Proof-irrelevant model of CC ... Pourmahdian and Mahdi Ali-Akbari An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms Oliver Friedmann Logical Methods in Computer SUPPORT CONTACT RECENTLY PUBLISHED The Complexity of Rooted Phylogeny Problems Manuel Bodirsky and Jens K. Mueller Proof-irrelevant model of CC ... Logical Methods in Computer SUPPORT CONTACT RECENTLY PUBLISHED ... Pourmahdian and Mahdi Ali-Akbari An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms Oliver Friedmann Logical Methods in Computer

View changes: 2011-11-23 21:05 34 new words, 38 deleted words, 31% change

... SUPPORT CONTACT RECENTLY PUBLISHED Proof-irrelevant model of CC with predicative induction and judgmental equality Gyesik Lee and Benjamin Werner ... Programs With Dynamic Creation of Threads Mohamed Faouzi Atig, Ahmed Bouajjani and Shaz Qadeer A decidable characterization of ... Iteration Algorithms Oliver Friedmann Power of Randomization in Automata on Infinite Strings Rohit Chadha, A. Prasad Sistla ... SUPPORT CONTACT RECENTLY PUBLISHED Proof-irrelevant model of CC with predicative induction and judgmental equality Gyesik Lee and Benjamin Werner ... Programs With Dynamic Creation of Threads Mohamed Faouzi Atig, Ahmed Bouajjani and Shaz Qadeer A decidable characterization of ... Logical Methods in Computer SUPPORT CONTACT RECENTLY PUBLISHED ... Iteration Algorithms Oliver Friedmann Power of Randomization in Automata on Infinite Strings Rohit Chadha, A. Prasad Sistla ... Rules for Higher-order Store Jan Schwinghammer, Lars Birkedal, Bernhard Reus and Hongseok Yang Logical Methods in Computer more...

link to this change log

Changes to the page www.lmcs-online.org/index.php are logged on this page as they are detected. You can link to this log by pasting the HTML below into your page. It produces a link which looks like this: change log

Logical Methods in Computer Science

monitor this page

summary of most recent changes

link to this change log

log in

search