| he LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community,with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available. The scope of LNCS, including its subseries LNAI and LNBI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes. -proceedings (published in time for the respective conference) -post-proceedings (consisting of thoroughly revised final full papers) -research monographs (which may be based on outstanding PhD work,research projects, technical reports, etc.) |
| Invited Paper Applications of Craig Interpolants in Model Checking Regular Model-Checking Verifying Programs with Dynamic l-Selector-Linked Structures in Regular Model Checking Simulation-Based Iteration of Tree Transducers Using Language Inference to Verify Omega-Regular Properties Infinite State Systems On-the-Fly Reachability and Cycle Detection for Recursive State Machines Empirically Efficient Verification for a Class of Infinite-State Systems Context-Bounded Model Checking of Concurrent Software A Generic Theorem Prover of CSP Refinement Abstract Interpretation Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems An Abstract Interpretation-Based Refinement Algorithm for Strong Preservation Dependent Types for Program Understanding Automata and Logics A Note on On-the-Fly Verification Algorithms Stefan Schwoon, Javier Esparza Truly On-the-Fly LTL Model Checking Complementation Constructions for Nondeterministic Automata on Infinite Words Using BDDs to Decide CTL Probabilistic Systems, Probabilistic Model-Checking Model-Checking Infinite-State Markov Chains Algorithmic Verification of Recursive Probabilistic State Machines Monte Carlo Model Checking Satisfiability Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit Bounded Validity Checking of Interval Duration Logic …… Testing Abstraction and Reduction Specification,Program Synthesis Model-Checking Tool Presentations Author Index |
内容加载中，请稍后...
商品评论（0条）