Complete symbolic reachability analysis using back-and-forth narrowing (Q860885): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2006.07.008 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.008 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4249555655 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4249555655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A needed narrowing strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional narrowing modulo a set of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the security of public key protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional and Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NRL Protocol Analyzer: An Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness results for basic narrowing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lazy narrowing: strong completeness and eager variable elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming in equational logic: Beyond strong sequentiality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebra and Coalgebra in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Techniques and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723905 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2006.07.008 / rank
 
Normal rank

Latest revision as of 05:50, 10 December 2024

scientific article
Language Label Description Also known as
English
Complete symbolic reachability analysis using back-and-forth narrowing
scientific article

    Statements

    Complete symbolic reachability analysis using back-and-forth narrowing (English)
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    narrowing
    0 references
    soundness
    0 references
    completeness
    0 references
    rewrite systems
    0 references
    reachability
    0 references

    Identifiers