Algebraic Methodology and Software Technology: 9th International Conference, AMAST 2002, Saint-Gilles-les- Bains, Reunion Island, France, September 9-13, 2002. ProceedingsHelene Kirchner, Christophe Ringeissen Springer, 2 aug. 2003 - 508 pagini This volume contains the proceedings of AMAST 2002, the 9th International Conference on Algebraic Methodology and Software Technology, held during September 9–13, 2002, in Saint-Gilles-les-Bains, R ́eunion Island, France. The major goal of the AMAST conferences is to promote research that may lead to setting software technology on a ?rm mathematical basis. This goal is achieved through a large international cooperation with contributions from both academia and industry. Developing a software technology on a mathematical basis p- duces software that is: (a) correct, and the correctness can be proved mathem- ically, (b) safe, so that it can be used in the implementation of critical systems, (c) portable, i. e. , independent of computing platforms and language generations, (d) evolutionary, i. e. , it is self-adaptable and evolves with the problem domain. All previous AMAST conferences, which were held in Iowa City (1989, 1991), Twente (1993), Montreal (1995), Munich (1996), Sydney (1997), Manaus (1999), and Iowa City (2000), made contributions to the AMAST goals by reporting and disseminating academic and industrial achievements within the AMAST area of interest. During these meetings, AMAST attracted an international following among researchers and practitioners interested in software technology, progr- ming methodology, and their algebraic, and logical foundations. |
Cuprins
1 | |
15 | |
ToolAssisted Specification and Verification of the JavaCard Platform | 41 |
HigherOrder Quantification and Proof Search | 60 |
Algebraic Support for ServiceOriented Architecture | 75 |
Christian Haack Brian Howard Allen Stoughton and Joe B Wells | 99 |
Removing Redundant Arguments of Functions | 117 |
A Class of Decidable Parametric Hybrid Systems | 132 |
Paolo Baldan Andrea Bracciali and Roberto Bruni | 271 |
On Bisimulations for the Spi Calculus | 287 |
Specifying and Verifying a Decimal Representation in Java | 304 |
A Method for Secure Smartcard Applications | 319 |
Extending JML Specifications with Temporal Logic | 334 |
Algebraic Dynamic Programming | 349 |
Analyzing String Buffers in C | 365 |
A Foundation of Escape Analysis | 380 |
Vacuity Checking in the Modal MuCalculus | 147 |
On Solving Temporal Logic Queries | 163 |
Modelling Concurrent Behaviours by Commutativity | 178 |
An Algebra of Nonsafe Petri Boxes | 192 |
Refusal Simulation and Interactive Games | 208 |
A Theory of May Testing for Asynchronous Calculi with Locality | 223 |
Equational Axioms for Probabilistic Bisimilarity | 239 |
Luca Aceto Zoltán Esik and Anna Ingólfsdóttir | 254 |
A Framework for OrderSorted Algebra | 396 |
Guarded Transitions in Evolving Specifications | 411 |
Revisiting the Categorical Approach to Systems | 426 |
Proof Transformations for Evolutionary Formal Software Development | 441 |
Sharing Objects by ReadOnly References | 457 |
A Denotational Comparison | 473 |
System Descriptions | 489 |
Alte ediții - Afișează-le pe toate
Algebraic Methodology and Software Technology: 9th International Conference ... Helene Kirchner,Christophe Ringeissen Previzualizare limitată - 2002 |
Algebraic Methodology and Software Technology: 9th International Conference ... Helene Kirchner,Christophe Ringeissen Nu există previzualizare disponibilă - 2002 |
Algebraic Methodology and Software Technology: 9th International Conference ... Helene Kirchner,Christophe Ringeissen Nu există previzualizare disponibilă - 2014 |
Termeni și expresii frecvente
abstract action algorithm analysis argument axioms behaviour bisimilarity bisimulation buffer bytecode calculus cardlet Casl colimit components Computer Science configuration construction constructor context decPart defined Definition denote diagram equations equivalence escape analysis example execution expressions extension finite formal formula function functors given implementation input interconnection interface Java JavaCard JCVM labels Lemma linear logic LNCS logic logic programming method minimal solution model checking morphisms MSOS multiset node notion object operational semantics output palindrome PBNDC predicate probabilistic problem Proc process calculus programming language proof obligations properties protocol quantification query reachable recursive redundancy refinement refusal simulation relation result rules Section signature smartcard Software spec specification spi calculus Springer Springer-Verlag structure symbols syntax temporal temporal logic Theorem theory tion transformation transition system variables verification weakly-controlled