新規登録 | ログイン | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

pganty library [78 articles]

最近 pganty さんのライブラリ .
  • A Unified Approach for Deciding the Existence of Certain Petri Net Paths
    Information and Computation, Vol. 96, No. 1. (1992), pp. 119-137.
    by Hsu-Chun Yen
    posted to no-tag by pganty on 2008-07-30 21:30:43 as **
  • ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement
    Practical Aspects of Declarative Languages (2007), pp. 245-259.
    by Andreas Podelski, Andrey Rybalchenko
    posted to no-tag by pganty on 2008-07-11 23:22:09 as ** along with 1 person zuleger
  • Petri nets and regular languages
    Journal of Computer and System Sciences, Vol. 23, No. 3. (December 1981), pp. 299-325.
    by Rüdiger Valk, Guy Vidal-Naquet
    posted to no-tag by pganty on 2008-05-30 19:38:51 as **
  • The covering and boundedness problems for vector addition systems
    Theoretical Computer Science, Vol. 6 (1978), pp. 223-231.
    by Charles Rackoff
    posted to no-tag by pganty on 2008-05-21 01:11:12 as **
  • Abstraction-Based Satisfiability Solving of Presburger Arithmetic
    Computer Aided Verification (2004), pp. 308-320.
    by Daniel Kroening, Joël Ouaknine, Sanjit A Seshia, Ofer Strichman
    posted to no-tag by pganty on 2008-04-16 06:30:37 as **
  • On the Efficient Computation of the Minimal Coverability Set for Petri Nets
    Automated Technology for Verification and Analysis (2007), pp. 98-113.
    by Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
    posted to no-tag by pganty on 2008-04-08 23:51:02 as **
  • Learning semilinear sets from examples and via queries
    Theoretical Computer Science, Vol. 104, No. 2. (12 October 1992), pp. 207-233.
    by Yuji Takada
    posted to no-tag by pganty on 2008-03-12 18:54:11 as **
  • Counting in Trees for Free
    Automata, Languages and Programming (2004), pp. 1136-1149.
    by Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl
    posted to no-tag by pganty on 2008-03-05 00:11:46 as **
  • On the Complexity of Equational Horn Clauses
    Automated Deduction – CADE-20 (2005), pp. 337-352.
    by Kumar N Verma, Helmut Seidl, Thomas Schwentick
    posted to no-tag by pganty on 2008-03-04 22:54:04 as ** along with 1 person tuncay
  • Deciding Monotonic Games
    Computer Science Logic (2003), pp. 1-14.
    by Parosh A Abdulla, Ahmed Bouajjani, Julien D’orso
    posted to no-tag by pganty on 2008-03-01 00:29:38 as **
  • Flat Counter Automata Almost Everywhere!
    Automated Technology for Verification and Analysis (2005), pp. 489-503.
    by Jérôme Leroux, Grégoire Sutre
    posted to no-tag by pganty on 2008-02-21 23:25:40 as **
  • Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
    Theoretical Computer Science, Vol. 221, No. 1-2. (28 June 1999), pp. 211-250.
    by Ahmed Bouajjani, Peter Habermehl
    posted to no-tag by pganty on 2008-02-20 19:41:52 as **
  • Computing Minimal Elements of Upward-Closed Sets for Petri Nets
    Petri Nets and Other Models of Concurrency – ICATPN 2007 (2007), pp. 465-483.
    by Hsu-Chun Yen, Chien-Liang Chen
    posted to no-tag by pganty on 2008-01-30 00:12:20 as **
  • Semantic Foundations of Program Analysis
    (1981), pp. 303-346.
    by Patrick Cousot
    edited by Steven S Muchnick, Neil D Jones
    posted to no-tag by pganty on 2008-01-29 23:13:20 as **
  • The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets
    Acta Informatica, Vol. 21 (1985), pp. 643-674.
    by Rudiger Valk, Matthias Jantzen
    posted to no-tag by pganty on 2008-01-29 17:40:57 as **
  • Name Creation vs. Replication in Petri Net Systems
    Petri Nets and Other Models of Concurrency – ICATPN 2007 (2007), pp. 402-422.
    by Fernando Rosa-Velardo, David de Frutos-Escrig
    posted to no-tag by pganty on 2008-01-29 17:35:08 as **
  • Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
    by M Viswanathan, R Chadha
    posted to no-tag by pganty on 2008-01-24 23:28:16 as **
  • Abstract Interpretation by Dynamic Partitioning
    Journal of Functional Programming, Vol. 2, No. 4. (1992), pp. 407-423.
    by Francois Bourdoncle
    posted to no-tag by pganty on 2007-08-28 13:37:16 as **** along with 1 group groupverif
  • Model Checking Multithreaded Programs with Asynchronous Atomic Methods
    : Computer Aided Verification (2006), pp. 300-314.
    by Koushik Sen, Mahesh Viswanathan
    posted to no-tag by pganty on 2007-04-11 13:49:07 as ** along with 1 group groupverif
  • Interprocedural analysis of asynchronous programs
    (2007), pp. 339-350.
    by Ranjit Jhala, Rupak Majumdar
    posted to no-tag by pganty on 2007-04-10 17:15:07 as ** along with 1 person and 1 group bunge groupverif
  • A unified approach to global program optimization
    (1973), pp. 194-206.
    by Gary A Kildall
    posted to no-tag by pganty on 2007-04-05 13:58:29 as ** along with 5 people and 1 group rnsanchez bdauvergne bunge clconway zuleger groupverif
  • Program Flow Analysis: Theory and Applications (Prentice-Hall Software Series)
    by Steven S Muchnick, Neil D Jones
    posted to no-tag by pganty on 2007-04-04 15:29:33 as ** along with 1 person and 1 group plaugg groupverif
  • Systematic design of program analysis frameworks
    (1979), pp. 269-282.
    by Patrick Cousot, Radhia Cousot
    posted to no-tag by pganty on 2007-04-04 15:26:50 as ** along with 2 people and 1 group surana bunge groupverif
  • Automatic discovery of linear restraints among variables of a program
    (1978), pp. 84-96.
    by Patrick Cousot, Nicolas Halbwachs
    posted to no-tag by pganty on 2007-04-04 15:25:22 as ** along with 3 people and 1 group eaubin bunge srccheck groupverif
  • Two approaches to interprocedural data flow analysis
    (1981), pp. 189-234.
    by Micha Sharir, Amir Pnueli
    edited by Steven S Muchnick, Neil D Jones
    posted to no-tag by pganty on 2007-04-04 14:50:26 as ** along with 1 group groupverif
  • Demand interprocedural dataflow analysis
    Vol. 20, No. 4. (October 1995), pp. 104-115.
    by Susan Horwitz, Thomas Reps, Mooly Sagiv
    posted to no-tag by pganty on 2007-04-03 13:06:41 as ** along with 1 group groupverif
  • The interprocedural coincidence theorem
    : Compiler Construction (1992), pp. 125-140.
    by Jens Knoop, Bernhard Steffen
    posted to no-tag by pganty on 2007-03-27 00:28:07 as ** along with 1 person and 1 group _Anne_ groupverif
  • Programs with Lists Are Counter Automata
    : Computer Aided Verification (2006), pp. 517-531.
    by Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomáš Vojnar
    posted to no-tag by pganty on 2007-03-26 20:11:41 as ** along with 1 group groupverif
  • A Technique for Invariant Generation
    : (2001), pp. 113-??.
    by A Tiwari, H Rueß, H Saïdi, N Shankar
    posted to no-tag by pganty on 2007-03-21 23:15:21 as ** along with 1 group groupverif
  • Relative Completeness of Abstraction Refinement for Software Model Checking
    : Tools and Algorithms for the Construction and Analysis of Systems : 8th International Conference, TACAS 2002, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2002, Grenoble, France, April 8-12, 2002. Proceedings (April 2002), 158.
    by Thomas Ball, Andreas Podelski, Sriram K Rajamani
    posted to no-tag by pganty on 2007-03-21 00:24:18 as ** along with 1 group groupverif
  • Abstractions from proofs
    Vol. 39, No. 1. (January 2004), pp. 232-244.
    by Thomas A Henzinger, Ranjit Jhala, Rupak Majumdar, Kenneth L Mcmillan
    posted to no-tag by pganty on 2007-03-20 22:05:26 as ** along with 1 person and 1 group bec groupverif
  • Lazy abstraction
    Vol. 37, No. 1. (January 2002), pp. 58-70.
    by Thomas A Henzinger, Ranjit Jhala, Rupak Majumdar, Gr&\#233;goire Sutre
    posted to no-tag by pganty on 2007-03-20 22:05:21 as ** along with 4 people and 1 group shimomura bec msakai zuleger groupverif
  • Interpolation and SAT-Based Model Checking
    : Computer Aided Verification (2003), pp. 1-13.
    by KL Mcmillan
    posted to no-tag by pganty on 2007-03-20 22:04:52 as ** along with 1 person and 1 group mccrimson groupverif
  • Incremental Verification by Abstraction
    : Tools and Algorithms for the Construction and Analysis of Systems: 7th International Conference, TACAS 2001: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001, Genova, Italy, April 2-6, 2001, Proceedings: (2001), 98.
    by Y Lakhnech, S Bensalem, S Berezin, S Owre
    posted to no-tag by pganty on 2007-03-20 18:51:38 as ** along with 1 group groupverif
  • Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
    (1977), pp. 238-252.
    by Patrick Cousot, Radhia Cousot
    posted to no-tag by pganty on 2007-03-19 17:43:11 as ** along with 6 people and 1 group eaubin andymaule srccheck pedagand _Anne_ zuleger groupverif
  • A Practical Framework for Demand-Driven Interprocedural Data Flow Analysis
    ACM Transactions on Programming Languages and Systems (TOPLAS), Vol. 19, No. 6. (1997), pp. 992-1030.
    by Evelyn Duesterwald, Rajiv Gupta, Mary L Soffa
    posted to no-tag by pganty on 2007-02-23 18:47:11 as ** along with 1 group groupverif
  • Interprocedural dataflow analysis via graph reachability
    No. 94/14. (1994)
    by T Reps, M Sagiv, S Horwitz
    posted to no-tag by pganty on 2007-02-23 18:47:11 as ** along with 1 group groupverif
  • Demand-driven computation of interprocedural data flow
    (1995), pp. 37-48.
    by Evelyn Duesterwald, Rajiv Gupta, Mary L Soffa
    posted to no-tag by pganty on 2007-02-23 18:47:11 as ** along with 1 group groupverif
  • CFL-Reachability in subcubic time
    No. Research Report RC24126 (W0611-203). (2006)
    by Swarat Chaudhuri
    posted to no-tag by pganty on 2007-02-23 18:47:11 as ** along with 1 group groupverif
  • Graph-Based Algorithms for Boolean Function Manipulation.
    IEEE Trans. Computers, Vol. 35, No. 8. (1986), pp. 677-691.
    by Randal E Bryant
    posted to no-tag by pganty on 2007-02-23 18:47:11 as ** along with 1 group groupverif
  • Ordering by divisibility in abstract algebras
    Proc.\ London Math.\ Soc.\ $(3)$, Vol. 2 (1952), pp. 326-336.
    by Graham Higman
    posted to no-tag by pganty on 2007-02-23 18:47:11 as ** along with 1 group groupverif
  • Downward Closed Language Generators
    No. 2003-001. (2003)
    by PA Abdulla, J Deneux, P Mahata, A Nylén
    posted to no-tag by pganty on 2007-02-23 18:47:11 as ** along with 1 group groupverif
  • Petri Nets with Non-blocking Arcs are Difficult to Analyse
    Vol. 96, No. 1. (2003)
    by JF Raskin, Laurent Van Begin
    posted to no-tag by pganty on 2007-02-23 18:47:11 as ** along with 1 group groupverif
  • On the Verification of Broadcast Protocols
    (1999), pp. 352-359.
    by J Esparza, A Finkel, R Mayr
    posted to no-tag by pganty on 2007-02-23 18:47:11 as ** along with 1 group groupverif
  • \sc Fast: Fast Acceleration of Symbolic Transition Systems
    Vol. 2725 (2003), pp. 118-121.
    by S Bardin, A Finkel, J Leroux, L Petrucci
    posted to no-tag by pganty on 2007-02-23 18:47:11 as ** along with 1 group groupverif
  • Towards the Automated Verification of Multithreaded Java Programs
    Vol. 2280 (2002), pp. 173-187.
    by Giorgio Delzanno, Jean F Raskin, Laurent Van Begin
    posted to no-tag by pganty on 2007-02-23 18:47:11 as ** along with 1 group groupverif
  • Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol
    Vol. 1579 (1999), pp. 208-222.
    by Parosh Abdulla, Aurore Annichini, Ahmed Bouajjani
    posted to no-tag by pganty on 2007-02-23 18:47:11 as ** along with 1 group groupverif
  • The Theory of Hybrid Automata
    (1996), pp. 278-292.
    by TA Henzinger
    posted to no-tag by pganty on 2007-02-23 18:47:11 as ** along with 1 group groupverif
  • A Theory of Timed Automata
    Theoretical Computer Science, Vol. 126, No. 2. (1994), pp. 183-236.
    by R Alur, DL Dill
    posted to no-tag by pganty on 2007-02-23 18:47:11 as ** along with 1 group groupverif
  • Reset Nets Between Decidability and Undecidability
    Vol. 1443 (1998), pp. 103-115.
    by C Dufourd, A Finkel, Ph Schnoebelen
    posted to no-tag by pganty on 2007-02-23 18:47:11 as ** along with 1 group groupverif
    • 注: このページを引用する時は次のURLでどうぞ: http://www.citeulike.org/user/pganty

    Result page: 1 2 Next RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.