% % % % automatically generated % % bibtex2html -v -html-links -use-icons -copy-icons -force ../options_generiques.bib options.bib ../../membres/lacl_membres.bib ../../biblio/cross.bib ../../biblio/verif/abderrahman.bib ../../biblio/verif/alrammal.bib ../../biblio/verif/brunet.bib ../../biblio/verif/cohen.bib ../../biblio/verif/dima.bib ../../biblio/verif/dumont.bib ../../biblio/verif/fortin.bib ../../biblio/verif/gava.bib ../../biblio/verif/gervais.bib ../../biblio/verif/gnaho.bib ../../biblio/verif/hains.bib ../../biblio/verif/laleau.bib ../../biblio/verif/milhau.bib ../../biblio/verif/mokdad.bib ../../biblio/verif/mourlin.bib ../../biblio/verif/pekergin.bib ../../biblio/verif/pelz.bib ../../biblio/verif/rabih.bib ../../biblio/verif/semmak.bib ../../biblio/verif/slissenko.bib ../../biblio/verif/tan.bib ../../biblio/verif/tran.bib ../../biblio/logic/bes.bib ../../biblio/logic/caspard.bib ../../biblio/logic/cegielski.bib ../../biblio/logic/cervelle.bib ../../biblio/logic/crolard.bib ../../biblio/logic/michel.bib ../../biblio/logic/polonowski.bib ../../biblio/logic/spicher.bib ../../biblio/logic/valarcher.bib ../../biblio/logic/verlan.bib ../../biblio/logic/past/carbone.bib ../../biblio/logic/past/durand.bib ../../biblio/logic/past/paskevich.bib ../../biblio/verif/past/arapinis.bib ../../biblio/verif/past/barbu.bib ../../biblio/verif/past/beauquier.bib ../../biblio/verif/past/bernichi.bib ../../biblio/verif/past/buithan.bib ../../biblio/verif/past/duflot.bib ../../biblio/verif/past/enea.bib ../../biblio/verif/past/gesbert.bib ../../biblio/verif/past/hait.bib ../../biblio/verif/past/klaudel.bib ../../biblio/verif/past/loulergue.bib ../../biblio/verif/past/pommereau.bib ../../biblio/verif/past/vasilyev.bib ../../biblio/autres/autres.bib ../../biblio/autres/lacoste.bib -sort-criterium year % Date: Sun Mar 4 20:58:59 2012 % Author: gava % % % @INPROCEEDINGS{alrammal12:electivity_technique, AUTHOR = {Muath Alrammal and Gaetan Hains}, BOOKTITLE = {8th International Conference on Innovations in Information Technology (IIT'12)}, TITLE = {A Stream-based Selectivity Estimation Technique for Forward XPath}, YEAR = {2012}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {to appear}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{icict2012, AUTHOR = {Muath Alrammal and Gaétan Hains}, BOOKTITLE = {International Conference on Information & Communications Technology (ICICT)}, TITLE = {Selectivity Estimation Technique for Wikipedia}, YEAR = {2012}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {To appear}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{gava12:_perfor_bsp, AUTHOR = {F. Gava and M. Guedj and F. Pommereau}, BOOKTITLE = {The 20th Euromicro International Conference on Parallel, Distributed and Network-Based Computing (PDP)}, TITLE = {Performance evaluations of a BSP algorithm for state space construction of security protocols}, YEAR = {2012}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {to appear}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{icls2012, AUTHOR = {Gaétan Hains and Muath Alrammal}, BOOKTITLE = {Second International Workshop on Intelligent Computing at Large Scale (ICLS), In Proceedings of the 6th International Conference on Complex, Intelligent, and Software Intensive Systems (CISIS)}, TITLE = {Performance and Scalability of XML Query Processing}, YEAR = {2012}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {To appear}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {} } @PROCEEDINGS{cegielski11:_donal_e_2, TITLE = {Donald E. Knuth, Algorithmiques (articles choisis et traduits)}, YEAR = {2011}, OPTADDRESS = {}, EDITOR = {Patrick Cégielski}, OPTMONTH = {}, NOTE = {xiv + 510 p}, OPTNUMBER = {}, OPTORGANIZATION = {}, PUBLISHER = {CSLI Publications, Stanford, Société Mathématique de France}, SERIES = {Lecture Notes}, OPTVOLUME = {} } @PROCEEDINGS{cegielski11:_donal_e, TITLE = {Donald E. Knuth, Éléments pour une histoire de l'informatique (articles choisis et traduits)}, YEAR = {2011}, OPTADDRESS = {}, EDITOR = {Patrick Cégielski}, OPTMONTH = {}, NOTE = {xvi + 371 p}, NUMBER = {190}, OPTORGANIZATION = {}, PUBLISHER = {CSLI Publications, Stanford, Sociéte Mathématique de France}, SERIES = {Lecture Notes}, OPTVOLUME = {} } @PROCEEDINGS{laleau11:_numero__infor, TITLE = {Numero special Inforsid 2010}, YEAR = {2011}, OPTADDRESS = {}, EDITOR = {Regine Laleau}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, ORGANIZATION = {Revue Ingenierie des Systemes d'Information}, OPTPUBLISHER = {}, OPTSERIES = {}, VOLUME = {16} } @PHDTHESIS{alrammal11:_algor_for_xml_stream_proces, AUTHOR = {Muath ALRAMMAL}, SCHOOL = {Université Paris-Est}, TITLE = {Algorithms for XML Stream Processing: Massive Data, External Memory and Scalable Performance}, YEAR = {2011}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, OPTTYPE = {}, KEYWORDS = {Streaming processing, XML data, XPath queries, query optimization, selectivity estimation, performance prediction model}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/muth_thesis.pdf}, ABSTRACT = {Many modern applications require processing of massive streams of XML data, creating difficult technical challenges. Among these, there is the design and implementation of applications to optimize the processing of XPath queries and to provide an accurate cost estimation for these queries processed on a massive steam of XML data. In this thesis, we propose a novel performance prediction model which a priori estimates the cost (in terms of space used and time spent) for any structural query belonging to Forward XPath. In doing so, we perform an experimental study to confirm the linear relationship between stream-processing and data-access resources. Therefore, we introduce a mathematical model (linear regression functions) to predict the cost for a given XPath query. Moreover, we introduce a new selectivity estimation technique. It consists of two elements. The first one is the path tree structure synopsis: a concise, accurate, and convenient summary of the structure of an XML document. The second one is the selectivity estimation algorithm: an efficient streamquerying algorithm to traverse the path tree synopsis for estimating the values of cost-parameters. Those parameters are used by the mathematical model to determine the cost of a given XPath query. We compare the performance of our model with existing approaches. Furthermore, we present a use case for an online stream-querying system. The system uses our performance predicate model to estimate the cost for a given XPath query in terms of time/memory. Moreover, it provides an accurate answer for the query's sender. This use case illustrates the practical advantages of performance management with our techniques.} } @INBOOK{cegielski11:_introd, PUBLISHER = {Centre régional de documentation pédagogique de l'académie de Paris}, TITLE = {Introduction à la science informatique, pour les enseignants de la discipline en lycée}, YEAR = {2011}, AUTHOR = {Patrick Cégielski}, CHAPTER = {sous la direction de Gilles Dowek (avec 18 autres auteurs)}, ALTEDITOR = {}, PAGES = {375}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @INBOOK{GeFr:2011:specialSPE, PUBLISHER = {John Wiley and Sons}, TITLE = {Software: Practice and Experience}, YEAR = {2011}, AUTHOR = {F. Gervais and B. Fraikin}, CHAPTER = {Tool Building in Formal Methods - Extended Papers from WS-TBFM 2010}, ALTEDITOR = {}, PAGES = {131-208}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @INBOOK{dubi10, PUBLISHER = {Springer}, TITLE = {Understanding the dynamics of biological systems}, YEAR = {2011}, AUTHOR = {Antoine Spicher and Olivier Michel and Jean-Louis Giavitto}, CHAPTER = {Interaction-based simulations for Integrative Spatial Systems Biology}, ALTEDITOR = {}, PAGES = {195-231}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {}, PDF = {http://www.lacl.fr/~michel/PUBLIS/2010/ibss.pdf} } @ARTICLE{AKMRV11, AUTHOR = {Artiom Alhazov and Marian Kogler and Maurice Margenstern and Yurii Rogozhin and Sergey Verlan}, JOURNAL = {Int. J. Found. Comput. Sci.}, TITLE = {Small Universal TVDH and Test Tube Systems}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {143--154}, VOLUME = {22} } @ARTICLE{AKRV10a, AUTHOR = {Artiom Alhazov and Alexander Krassovitskiy and Yurii Rogozhin and Sergey Verlan}, JOURNAL = {Theoretical Computer Science}, TITLE = {P Systems with Minimal Insertion and Deletion}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1-2}, PAGES = {136--144}, VOLUME = {412} } @ARTICLE{AV11, AUTHOR = {Artiom Alhazov and Sergey Verlan}, JOURNAL = {Theoretical Computer Science}, TITLE = {Minimization Strategies for Maximally Parallel Multiset Rewriting Systems}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {17}, PAGES = {1581--1591}, VOLUME = {412}, URL = {http://www.sciencedirect.com/science/article/B6V1G-51C4RWM-1/2/8dd35e3d83efe5552d0d6dfb05e45afc}, DOI = {10.1016/j.tcs.2010.10.033} } @ARTICLE{DBLP:journals/fuin/AndaryPV11, AUTHOR = {Philippe Andary and Bruno Patrou and Pierre Valarcher}, JOURNAL = {Fundam. Inform.}, TITLE = {A Representation Theorem for Primitive Recursive Algorithms}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {313--330}, VOLUME = {107}, DOI = {10.3233/FI-2011-405} } @ARTICLE{taas2011, AUTHOR = {Jacob Beal and Olivier Michel and Ulrik Pagh Schultz}, JOURNAL = {ACM Trans. Auton. Adapt. Syst.}, TITLE = {Spatial Computing: Distributed Systems That Take Advantage of Our Geometric World}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {1--3}, VOLUME = {6}, PUBLISHER = {ACM}, PDF = {http://www.lacl.fr/~michel/PUBLIS/2011/taas.pdf}, DOI = {10.1145/1968513.1968514} } @ARTICLE{BesRabinovich11, AUTHOR = {Alexis Bès and Alexander Rabinovich}, JOURNAL = {Logical Methods in Computer Science}, TITLE = {Decidable Expansions of Labelled Linear Orderings}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2:7}, OPTPAGES = {}, VOLUME = {7} } @ARTICLE{castel-taleb11:_bound, AUTHOR = {Hind Castel-Taleb and Idriss Ismael-Aouled and Nihal Pekergin}, JOURNAL = {The Computer Journal}, TITLE = {Bounding aggregations for transient and stationary performance analysis of subnetworks}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTPAGES = {}, OPTVOLUME = {}, DOI = {10.1093/comjnl/bxr036} } @ARTICLE{CV2010, AUTHOR = {Erzsébet Csuhaj-Varjú and Sergey Verlan}, JOURNAL = {Theoretical Computer Science}, TITLE = {On Generalized Communicating P Systems with Minimal Interaction Rules}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1-2}, PAGES = {124--135}, VOLUME = {412} } @ARTICLE{Dao-Thi:2011:GSA:1959867.1959917, AUTHOR = {Thu-Ha Dao-Thi and Jean-Michel Fourneau and Minh-Anh Tran}, JOURNAL = {Performance Evaluation}, TITLE = {G-networks with synchronised arrivals}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {309--319}, VOLUME = {68}, KEYWORDS = {G-networks, Product form, Quasi-reversibility, Synchronised arrivals}, DOI = {10.1016/j.peva.2010.09.006} } @ARTICLE{DBLP:journals/cj/Dao-ThiFT11, AUTHOR = {Thu-Ha Dao-Thi and Jean-Michel Fourneau and Minh-Anh Tran}, JOURNAL = {Computer Journal}, TITLE = {Multiple Class Symmetric G-networks with Phase Type Service Times}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {274--284}, VOLUME = {54}, PUBLISHER = {Oxford University Press}, URL = {http://comjnl.oxfordjournals.org/content/early/2010/09/02/comjnl.bxq067}, DOI = {10.1093/comjnl/bxq067} } @ARTICLE{dima-diaconu, AUTHOR = {R. Diaconu and C. Dima}, JOURNAL = {Applied Artificial Intelligence}, TITLE = {Model-Checking Alternating-time Temporal Logic with Strategies Based on Common Knowledge Is Undecidable}, YEAR = {2011}, OPTMONTH = {}, NOTE = {To appear}, OPTNUMBER = {}, OPTPAGES = {}, OPTVOLUME = {} } @ARTICLE{dima-lanotte-distributed-computing, AUTHOR = {C. Dima and R. Lanotte}, JOURNAL = {Distributed Computing}, TITLE = {A study on shuffle, stopwatches and independently evolving clocks}, YEAR = {2011}, OPTMONTH = {}, NOTE = {To appear}, OPTNUMBER = {}, OPTPAGES = {}, OPTVOLUME = {} } @ARTICLE{djouama11:_perfor_evaluat_lifet_admis_contr, AUTHOR = {A. Djouama and L. Mokdad and M. Abdennebi}, JOURNAL = {Concurrency and Computation: Practice and Experience}, TITLE = {Performance Evaluation of Lifetime-driven Admission Control for Infrastructure-less Clustered Wireless Networks}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTPAGES = {}, OPTVOLUME = {} } @ARTICLE{GG2010:IJPEDS, AUTHOR = {I. Garnier and F. Gava}, JOURNAL = {Parallel, Emergent and Distributed Systems}, TITLE = {CPS Implementation of a BSP Composition Primitive with Application to the Implementation of Algorithmic Skeletons}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {251-273}, VOLUME = {26}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_ijpeds_2010.pdf}, DOI = {10.1080/17445760.2010.481785} } @ARTICLE{guelev-dima-enea-jancl, AUTHOR = {D. Guelev and C. Dima and C. Enea}, JOURNAL = {Journal of Applied Non-Classical Logics}, TITLE = {An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {93-131}, VOLUME = {21} } @ARTICLE{EmFrGeLaSt:2011:revueIJSSOE, AUTHOR = {M. Embe Jiague and M. Frappier and F. Gervais and R. Laleau and R. St-Denis}, JOURNAL = {International Journal of Systems and Service-Oriented Engineering}, TITLE = {Enforcing ASTD access-control policies with WS-BPEL processes in SOA environments}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {37-59}, VOLUME = {2}, PUBLISHER = {IGI Publishing} } @ARTICLE{KRV10, AUTHOR = {Alexander Krassovitskiy and Yurii Rogozhin and Sergey Verlan}, JOURNAL = {Natural Computing}, TITLE = {Computational Power of Insertion-Deletion (P) Systems with Rules of Size Two}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {1--18}, OPTVOLUME = {}, PUBLISHER = {Springer Netherlands}, DOI = {10.1007/s11047-010-9208-y} } @ARTICLE{milhauUMLFM2011, AUTHOR = {Jérémy Milhau and Akram Idani and Régine Laleau and Mohamed Amine Labiadh and Yves Ledru and Marc Frappier}, JOURNAL = {In International NASA Journal on Innovations in Systems and Software Engineering (ISSE), Special Issue of UMLFM 2011 workshop}, TITLE = {Combining UML, ASTD and B for the Formal Specification of an Access Control Filter}, YEAR = {2011}, OPTMONTH = {}, NOTE = {to be published}, OPTNUMBER = {}, OPTPAGES = {}, OPTVOLUME = {}, DOI = {10.1007/s11334-009-0106-3} } @ARTICLE{DBLP:journals/jpdc/MokdadB11, AUTHOR = {Lynda Mokdad and Jalel Ben-Othman}, JOURNAL = {J. Parallel Distrib. Comput.}, TITLE = {Admission control mechanism and performance analysis based on stochastic automata networks formalism}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {594--602}, VOLUME = {71}, DOI = {10.1016/j.jpdc.2010.11.008} } @ARTICLE{DBLP:journals/tpds/MokdadSB11, AUTHOR = {Lynda Mokdad and Mbaye Sene and Azzedine Boukerche}, JOURNAL = {IEEE Trans. Parallel Distrib. Syst.}, TITLE = {Call Admission Control Performance Analysis in Mobile Networks Using Stochastic Well-Formed Petri Nets}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {8}, PAGES = {1332--1341}, VOLUME = {22}, URL = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.90} } @ARTICLE{mokdad11:_stoch_web, AUTHOR = {L. Mokdad and S. Youcef}, JOURNAL = {Journal of cluster computing}, TITLE = {Stochastic bounds for composite Web services response times}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {CLUS-287}, OPTPAGES = {}, OPTVOLUME = {}, URL = {http://www.springerlink.com/content/d373p56j8255j987/} } @ARTICLE{norris2011, AUTHOR = {Vic Norris and Abdallah Zemirline and Patrick Amar and Jean Audinot and Pascal Ballet and Eshel Ben-Jacob and Gilles Bernot and Guillaume Beslon and Armelle Cabin and Eric Fanchon and Jean-Louis Giavitto and Nicolas Glade and Patrick Greussay and Yohann Grondin and James Foster and Guillaume Hutzler and Jörgen Jost and Francois Kepes and Olivier Michel and Franck Molina and Jacqueline Signorini and Pasquale Stano and Alain Thierry}, JOURNAL = {Theory in Biosciences}, TITLE = {Computing with bacterial constituents, cells and populations: from bioputing to bactoputing}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {1--18}, OPTVOLUME = {}, KEYWORDS = {Biomedical and Life Sciences}, PUBLISHER = {Springer}, PDF = {http://www.lacl.fr/~michel/PUBLIS/2011/tib.pdf}, ABSTRACT = {The relevance of biological materials and processes to computing (bioputing) has been explored for decades. These materials include DNA, RNA and proteins, while the processes include transcription, translation, signal transduction and regulation. Recently, the use of bacteria themselves as living computers has been explored but this use generally falls within the classical paradigm of computing. Computer scientists, however, have a variety of problems to which they seek solutions, while microbiologists are having new insights into the problems bacteria are solving and how they are solving them. Here, we envisage that bacteria might be used for new sorts of computing. These could be based on the capacity of bacteria to grow, move and adapt to a myriad different fickle environments both as individuals and as populations of bacteria plus bacteriophage. New principles might be based on the way that bacteria explore phenotype space via hyperstructure dynamics and the fundamental nature of the cell cycle. This computing might even extend to developing a high level language appropriate to using populations of bacteria and bacteriophage. Here, we offer a speculative tour of what we term bactoputing, namely the use of the natural behaviour of bacteria for calculating.}, DOI = {10.1007/s12064-010-0118-4} } @ARTICLE{pekergin11:_introd_special_issue_probab_model_perfor_analy, AUTHOR = {Nihal Pekergin}, JOURNAL = {The Computer Journal}, TITLE = {Introduction to the Special Issue on Probability Models in Performance Analysis}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTPAGES = {}, OPTVOLUME = {}, DOI = {10.1093/comjnl/bxr050} } @ARTICLE{rabih11:_stead_state_proper_verif_for, AUTHOR = {Diana El Rabih and Gael Gorgo and Nihal Pekergin and Jean-Marc Vincent}, JOURNAL = {International Journal of Critical Computer-Based Systems}, TITLE = {Steady state property verification for very large systems}, YEAR = {2011}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2-3}, PAGES = {309--331}, VOLUME = {2}, DOI = {10.1504/IJCCBS.2011.042331} } @INPROCEEDINGS{alrammal11:_path_tree, AUTHOR = {Muath Alrammal and Gaetan Hains and Mohamed Zergaoui}, BOOKTITLE = {The Fifth International Conference on Complex, Intelligent, and Software Intensive Systems (CISIS)}, TITLE = {Path tree: document synopsis for XPath query selectivity estimation}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {321--328}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/qest/BallariniDDHP11, AUTHOR = {Paolo Ballarini and Hilal Djafri and Marie Duflot and Serge Haddad and Nihal Pekergin}, BOOKTITLE = {Eighth International Conference on Quantitative Evaluation of Systems (QEST)}, TITLE = {COSMOS: A Statistical Model Checker for the Hybrid Automata Stochastic Logic}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {143--144}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://doi.ieeecomputersociety.org/10.1109/QEST.2011.24} } @INPROCEEDINGS{ballarini11:_hasl, AUTHOR = {Paolo Ballarini and Hilal Djafri and Marie Duflot and Serge Haddad and Nihal Pekergin}, BOOKTITLE = {5th International ICST Conference on Performance Evaluation Methodologies and Tools (ValueTools)}, TITLE = {HASL : an Expressive Language for Statistical Verification of Stochastic Models}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {ACM Digital Library}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/case/BallariniDDHP11, AUTHOR = {Paolo Ballarini and Hilal Djafri and Marie Duflot and Serge Haddad and Nihal Pekergin}, BOOKTITLE = {IEEE Conference on Automation Science and Engineering (CASE)}, TITLE = {Petri nets compositional modeling and verification of Flexible Manufacturing Systems}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {588--593}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/CASE.2011.6042488} } @INPROCEEDINGS{ben-othman11:_improv_qos_ugs_be_wimax, AUTHOR = {J. Ben-Othman and L. Mokdad}, BOOKTITLE = {International Conference on Communications and Information Technology (ICCIT)}, TITLE = {Improving QoS for UGS, rtPS, nrtPS, BE in WIMAX networks}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {(Best paper award)}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE communication society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{ben-othman11:_perfor_compar_between_ibc_hwmp_hash_hwmp, AUTHOR = {J. Ben-Othman and L. Mokdad and Y. Saavedra Benitez}, BOOKTITLE = {Global Communications conference (GLOBECOM)}, TITLE = {Performance Comparison Between IBC-HWMP and Hash-HWMP}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1--6}, PUBLISHER = {IEEE communication society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{ben-othman11:_ieee, AUTHOR = {J. Ben-Othman and L. Mokdad and M. Ould-Cheikh}, BOOKTITLE = {International Conference on Communications (ICC)}, TITLE = {A new architecture of wireless mesh networks based IEEE 802.11s directional antennas}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE communication society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{ben-othman11:_sector_cover_deploy_wmn_backb, AUTHOR = {J. Ben-Othman and L. Mokdad and M. Ould-Cheikh}, BOOKTITLE = {Global Communications conference (GLOBECOM)}, TITLE = {Sectorial Coverage in a Deployment of a WMN Backbone Based on Directional Antennas}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {6--12}, PUBLISHER = {IEEE communication society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{ben-othman11:_energ_effic_prior_qos_mac, AUTHOR = {J. Ben-Othman and L. Mokdad and B. Yahya}, BOOKTITLE = {International Conference on Communications (ICC)}, TITLE = {An Energy Efficient Priority-based QoS MAC Protocol for Wireless Sensor Networks}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {(Best paper award)}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE communication society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{BOUSDIRA:2011:HAL-00592542:1, AUTHOR = {Wadoud Bousdira and Louis Gesbert and Frédéric Loulergue}, BOOKTITLE = {Journées Francophones des Langages Applicatifs}, TITLE = {Syntaxe et sémantique de Revised Bulk Synchronous Parallel ML}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {117--146}, PUBLISHER = {Hermann}, SERIES = {Studia Informatica Universalis}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00592542/en/} } @INPROCEEDINGS{BesCarton11, AUTHOR = {Alexis Bès and Olivier Carton}, BOOKTITLE = {25th International Workshop of Computer Science Logic (CSL), part of 20th Annual Conference of the EACSL}, TITLE = {Algebraic Characterization of FO for Scattered Linear Orderings}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Marc Bezem}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {67--81}, PUBLISHER = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)}, VOLUME = {12}, KEYWORDS = {linear orderings, first-order logic, semigroups, rational sets}, URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3223}, DOI = {10.4230/LIPIcs.CSL.2011.67} } @INPROCEEDINGS{castel-taleb11:_bound_g, AUTHOR = {Hind Castel-Taleb and Idriss Ismael-Aouled and Nihal Pekergin}, BOOKTITLE = {5th International ICST Conference on Performance Evaluation Methodologies and Tools (ValueTools)}, TITLE = {Bounding techniques for transient analysis of G-networks with catastrophes}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {ACM Digital Library}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{castel-taleb11:_choic_stoch_compar_method_multid, AUTHOR = {Hind Castel-Taleb and N. Pekergin}, BOOKTITLE = {5th International ICST Conference on Performance Evaluation Methodologies and Tools (ValueTools)}, TITLE = {On the Choice of the Stochastic Comparison Method for Multidimensional Markov Chains Analysis}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {ACM Digital Library}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{EmFrGeKoLaMiSt:2011:ICETE, AUTHOR = {Embe Jiague, Michel and Marc Frappier and Frédéric Gervais and Pierre Konopacki and Régine Laleau and Jérémy Milhau and Richard St-Denis}, BOOKTITLE = {8th International Joint Conference on e-Business and Telecommunications (ICETE)}, TITLE = {A four-concern-oriented secure IS development approach}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {INSTICC Press}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {464--471}, OPTPUBLISHER = {}, OPTSERIES = {}, VOLUME = {SECRYPT 2011} } @INPROCEEDINGS{GAVA:2011:HAL-00605566:1, AUTHOR = {Frédéric Gava and Louis Gesbert and Frédéric Loulergue}, BOOKTITLE = {5th ACM SIGPLAN workshop on High-Level Parallel Programming and Applications}, TITLE = {Type System for a Safe Execution of Parallel Programs in BSML}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {ACM}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00605566/en/} } @INPROCEEDINGS{gava11:_mentat_et_diction_des_perfor, AUTHOR = {F. Gava and S. Tan}, BOOKTITLE = {Journees Francophones des Langages Applicatifs (JFLA)}, TITLE = {Implementation et prediction des performances de squelettes data-paralleles en utilisant un langage BSP de haut-niveau}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {S. Conchon and A. Mahboudi}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {39--65}, PUBLISHER = {Hermann}, SERIES = {Studia Informatica Universalis}, OPTVOLUME = {} } @INPROCEEDINGS{scsc11, AUTHOR = {Jean-Louis Giavitto and Olivier Michel and Antoine Spicher}, BOOKTITLE = {Summer Computer Simulation Conference}, TITLE = {Interaction Based Simulation of Dynamical System with a Dynamical Structure (DS)2 in MGS}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {Accepted for publication}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://www.lacl.fr/~michel/PUBLIS/2011/scsc11.pdf}, ABSTRACT = {We present the domain specific programming language MGS and its approach to the specification of dynamical systems with a dynamical structure or (DS)2. MGS stands 'encore un Modele General de Simulation', that is, 'Yet another geneeral model of simulation'. Its declarative approach is based on the notions of chains and cochains well studied in algebraic topology. A careful discussion of the design goals lead us to relax some of the constraints on these mathematical structures to represent in a uniform way various data structures and transformations. In particular, our computational notion of transformation relies on a rewriting mechanism encompassing the usual notions of set, string and term rewriting. These notions are illustrated on two examples involving the implicit computation of a time varying neighborhood: the simulation of the trajectories of floocking birds and the growth of an epithelial tissue. The second example illustrates also the compositionality achieved by the declarative framework. The MGS concepts have been further validated on several large scale simulations of complex biological systems.} } @INPROCEEDINGS{EmFrGeLaSt:2011:FPS, AUTHOR = {M. Embe Jiague and M. Frappier and F. Gervais and R. Laleau and R. St-Denis}, BOOKTITLE = {4th MITACS Workshop on Foundations and Practice of Security (FPS 2011)}, TITLE = {A metamodel for the design of access-control policy enforcement managers: work in progress}, YEAR = {2011}, ADDRESS = {Paris, France}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {12-13 May}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {218-226}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {6888} } @INPROCEEDINGS{DBLP:conf/iscc/KasseM11, AUTHOR = {Youssou Kasse and Lynda Mokdad}, BOOKTITLE = {16th IEEE Symposium on Computers and Communications (ISCC)}, TITLE = {Quantitative verification for response times in composite Web service model}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {97--102}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/ISCC.2011.5984034} } @INPROCEEDINGS{wccce11-paper10, AUTHOR = {Y. Khmelevsky and M. Govorov and G. Hains and L. Burge}, BOOKTITLE = {ACM SIG-CSE Western Canadian Conference on Computing Education}, TITLE = {Distance Learning Components in Computer Science and GIS}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {ACM Digital Library}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{wccce11-paper9, AUTHOR = {Y. Khmelevsky and G. Hains and E. Ozan and V. Ustimenko and C. Kluka and D. Syrotovsky}, BOOKTITLE = {ACM SIG-CSE Western Canadian Conference on Computing Education}, TITLE = {International Collaboration in SW Engineering Research Projects}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {ACM Digital Library}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{konopacki11:_expres_acces_contr_polic_event_based_approac, AUTHOR = {Pierre Konopacki and Marc Frappier and Regine Laleau}, BOOKTITLE = {1st International Workshop on Information Systems Security Engineering (WISSE) host by CAISE}, TITLE = {Expressing Access Control Policies with an Event-Based Approach}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer}, SERIES = {LNBIP}, OPTVOLUME = {}, ANNOTE = {to be published} } @INPROCEEDINGS{ledru11:_takin_accoun_funct_model_valid, AUTHOR = {Yves Ledru and Akram Idani and Jérémy Milhau and Nafees Qamar and Régine Laleau and Jean-Luc Richier and Mohamed-Amine Labiadh}, BOOKTITLE = {1st International Workshop on Information Systems Security Engineering (WISSE) host by CAISE}, TITLE = {Taking into Account Functional Models in the Validation of IS Security Policies}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Camille Salinesi and Oscar Pastor and Wil Aalst and John Mylopoulos and Michael Rosemann and Michael J. Shaw and Clemens Szyperski}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {592--606}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Business Information Processing}, VOLUME = {83}, ABSTRACT = {Designing a security policy for an information system (IS) is a non-trivial task. Variants of the RBAC model can be used to express such policies as access-control rules associated to constraints. In this paper, we advocate that currently available tools do not take sufficiently into account the functional description of the application and its impact on authorisation constraints and dynamic aspects of security. We suggest to translate both security and functional models into a formal language, such as B, whose analysis and animation tools will help validate a larger set of security scenarios. We show how various kinds of constraints can be expressed and animated in this context.}, DOI = {10.1007/978-3-642-22056-2_62} } @INPROCEEDINGS{li11:_simpl_bridg_model_for_high_perfor_comput, AUTHOR = {C. Li and G. Hains}, BOOKTITLE = {(HPCS2011) International Conference on High Performance Computing and Simulation}, TITLE = {A Simple Bridging Model for High-Performance Computing}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{matoussi11:_specif_local_compon_driven_goal_based_approac, AUTHOR = {Abderrahman MATOUSSI and Frederic GERVAIS and Regine LALEAU}, BOOKTITLE = {13th Brazilian Symposium on Formal Methods}, TITLE = {Specification of a Localization Component Driven by a Goal-Based Approach: Some Lessons We Learned}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {177--193}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {6527} } @INPROCEEDINGS{matoussi11:_une_event_b, AUTHOR = {Abderrahman MATOUSSI and Frederic GERVAIS and Regine LALEAU}, BOOKTITLE = {Actes du 29eme Congres INFORSID}, TITLE = {Une premiere approche de tracabilite entre modeles d'exigences non-fonctionnelles et specifications abstraites Event-B}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{matoussi11:_goal_based_approac_guide_desig, AUTHOR = {Abderrahman Matoussi and Frederic Gervais and Regine Laleau}, BOOKTITLE = {16th International Conference on Engineering of Complex Computer Systems}, TITLE = {A Goal-Based Approach to Guide the Design of an Abstract Event-B Specification}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{fps, AUTHOR = {Jérémy Milhau and Marc Frappier and Régine Laleau}, BOOKTITLE = {4th Canada-France MITACS Workshop on Foundations & Practice of Security}, TITLE = {A Metamodel of the B Modeling of Access-Control Policies}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {6888} } @INPROCEEDINGS{mokdad11:_evaluat_lifet_wirel_sensor_networ, AUTHOR = {L. Mokdad}, BOOKTITLE = {Local Computer Network (LCN)}, TITLE = {Evaluation of Lifetime in Wireless Sensor Networks}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE computer society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{pazzi11:_e_trail, AUTHOR = {R. W. Pazzi and D. Zhang and A. Boukerche and L. Mokdad}, BOOKTITLE = {International Conference on Communications (ICC)}, TITLE = {E-TRAIL: Energy-Efficient Trail-based Data Dissemination Protocol for Wireless Sensor Networks with Mobile Sinks}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE communication society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{polonowski11:_gener_envir_coq, AUTHOR = {Emmanuel Polonowski}, BOOKTITLE = {Coq'3}, TITLE = {Generic Environments in Coq}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{LPZEP:CSP11, AUTHOR = {L. Popova-Zeugmann and E. Pelz}, BOOKTITLE = {CS&P}, TITLE = {State Equation for Interval-Timed Petri Nets}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{LPZEP:BioPPN11, AUTHOR = {L. Popova-Zeugmann and E. Pelz}, BOOKTITLE = {BioPPN}, TITLE = {Studying Steady States in Biochemical Reaction Systems by Time Petri Nets,}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {71--86}, PUBLISHER = {CEUR}, OPTSERIES = {}, VOLUME = {724}, URL = {http://ceur-ws.org/Vol-724/paper6.pdf} } @INPROCEEDINGS{LPZEP:MECBIC11, AUTHOR = {L. Popova-Zeugmann and E. Pelz}, BOOKTITLE = {MeCBIC}, TITLE = {Time-Lengths in Time Petri Net Models for Steady States in Biochemical Systems}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{rabih11:_effic_and_scalab_stead_state_depen_verif, AUTHOR = {Diana El Rabih and Nihal Pekergin}, BOOKTITLE = {4th International Conference on Dependability (DEPEND), part of NETWARE}, TITLE = {Efficient and scalable steady-state dependability verification}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {Best paper Awarded}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {18--23}, PUBLISHER = {IARIA}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/wcnc/RenBM11, AUTHOR = {Yonglin Ren and Azzedine Boukerche and Lynda Mokdad}, BOOKTITLE = {IEEE Wireless Communications and Networking Conference (WCNC)}, TITLE = {Performance analysis of a selective encryption algorithm for wireless ad hoc networks}, YEAR = {2011}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1038--1043}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/WCNC.2011.5779278} } @TECHREPORT{TR-LACL-2011-1, AUTHOR = {Gaetan Hains and Muath Alrammal and Mohamed Zergaoui}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (UPEC-Paris 12)}, TITLE = {Performance and scalability of XML query processing}, YEAR = {2011}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2011-1}, OPTTYPE = {}, PDF = {http://lacl.fr/Rapports/TR/TR-LACL-2011-1.pdf} } @TECHREPORT{TR-LACL-2011-3, AUTHOR = {S. Mallick and G. Hains}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (UPEC-Paris 12)}, TITLE = {A Resource Prediction Model for Virtualization Servers}, YEAR = {2011}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2011-3}, OPTTYPE = {}, PDF = {http://lacl.fr/Rapports/TR/TR-LACL-2011-3.pdf} } @TECHREPORT{TR-LACL-2011-2, AUTHOR = {Diana El Rabih and Nihal Pekergin}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Efficient and scalable steady-state dependability verification}, YEAR = {2011}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2011-2}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2011-2.pdf} } @PROCEEDINGS{cegielski10:_studies_weak_arith, TITLE = {Studies in Weak Arithmetics}, YEAR = {2010}, OPTADDRESS = {}, EDITOR = {Patrick Cégielski}, OPTMONTH = {}, NOTE = {vii + 213 p}, NUMBER = {196}, OPTORGANIZATION = {}, PUBLISHER = {CSLI Publications, Stanford}, SERIES = {Lecture Notes}, OPTVOLUME = {} } @PROCEEDINGS{fournier10:_actes_congr_infor, TITLE = {Actes du 28eme Congres INFORSID}, YEAR = {2010}, OPTADDRESS = {}, EDITOR = {Sebastien FOURNIER and Regine LALEAU}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {https://liris.cnrs.fr/inforsid/?q=Actes%20Inforsid} } @PROCEEDINGS{frappier10:_special_aebst_state_machin_alloy_b_z, TITLE = {Special issue Abstract State Machines, Alloy, B and Z}, YEAR = {2010}, OPTADDRESS = {}, EDITOR = {Marc Frappier and Uwe Glasser and Sarfraz Khurshid and Regine Laleau and Steve Reeves}, OPTMONTH = {}, NOTE = {selected papers from ABZ. To be published}, OPTNUMBER = {}, ORGANIZATION = {Science of Computer Programming}, PUBLISHER = {Elsevier}, OPTSERIES = {}, OPTVOLUME = {} } @PROCEEDINGS{DBLP:conf/asm/2010, TITLE = {Abstract State Machines, Alloy, B and Z, Second International Conference, ABZ 2010, Orford, QC, Canada, February 22-25, 2010. Proceedings}, YEAR = {2010}, OPTADDRESS = {}, EDITOR = {Marc Frappier and Uwe Glässer and Sarfraz Khurshid and Régine Laleau and Steve Reeves}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5977}, BOOKTITLE = {ABZ}, DOI = {10.1007/978-3-642-11811-1} } @ARTICLE{Alhazovetal2010, AUTHOR = {Alhazov Artiom and Boian Elena and BurÅ£eva Liudmila and Ciubotaru Constantin and Cojocaru Svetlana and Colesnicov Alexandru and Demidova Valentina and Ivanov Sergiu and Macari Veaceslav and Magariu Galina and Malahov Ludmila and Rogojin Vladimir and Rogojin Iurie and Tofan Tatiana and Verlan Serghei and Verlan Tatiana}, JOURNAL = {Computer Science Journal of Moldova}, TITLE = {Investigations on Natural Computing in the Institute of Mathematics and Computer Science}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {101--138}, VOLUME = {18} } @ARTICLE{DBLP:journals/apal/ArtemovMMS10, AUTHOR = {Sergei N. Artëmov and Yuri Matiyasevich and Grigori Mints and Anatol Slissenko}, JOURNAL = {Ann. Pure Appl. Logic}, TITLE = {Preface}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {173--174}, VOLUME = {162}, DOI = {10.1016/j.apal.2010.09.002} } @ARTICLE{dima-asarin-ita10, AUTHOR = {E. Asarin and C. Dima}, JOURNAL = {RAIRO - Theoretical Informatics and Applications}, TITLE = {On the computation of covert channel capacity}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {37--58}, VOLUME = {44} } @ARTICLE{BedonBCR10, AUTHOR = {N. Bedon and A. Bès and O. Carton and C. Rispal}, JOURNAL = {Theory of Computing Systems}, TITLE = {Logic and Rational Languages of Words Indexed by Linear Orderings}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {737-760}, VOLUME = {46} } @ARTICLE{DBLP:journals/jpdc/Ben-OthmanM10, AUTHOR = {Jalel Ben-Othman and Lynda Mokdad}, JOURNAL = {J. Parallel Distrib. Comput.}, TITLE = {Enhancing data security in ad hoc networks based on multipath routing}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {309--316}, VOLUME = {70}, DOI = {10.1016/j.jpdc.2009.02.010} } @ARTICLE{DBLP:journals/comsis/CrepinsekKMCFR10, AUTHOR = {Matej Crepinsek and Tomaz Kosar and Marjan Mernik and Julien Cervelle and Rémi Forax and Gilles Roussel}, JOURNAL = {Comput. Sci. Inf. Syst.}, TITLE = {On automata and language based grammar metrics}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {309--329}, VOLUME = {7}, DOI = {10.2298/CSIS1002309C} } @ARTICLE{dima-jlc2010, AUTHOR = {C. Dima}, JOURNAL = {Journal of Logic and Computation}, TITLE = {Non-axiomatizability for Linear Temporal Logic of Knowledge with Concrete Observability}, YEAR = {2010}, OPTMONTH = {}, NOTE = {To appear}, OPTNUMBER = {}, OPTPAGES = {}, OPTVOLUME = {} } @ARTICLE{dima-tiplea10, AUTHOR = {C. Dima and F. L. Tiplea}, JOURNAL = {Logical Methods in Computer Science}, TITLE = {Model-checking ATL under imperfect information and perfect recall semantics is undecidable}, YEAR = {2010}, OPTMONTH = {}, NOTE = {Submitted}, OPTNUMBER = {}, OPTPAGES = {}, OPTVOLUME = {} } @ARTICLE{DUMONT:2010:HAL-00612627:1, AUTHOR = {Cyril Dumont and Fabrice Mourlin}, JOURNAL = {International Journal of Computer Science and Information Technologies}, TITLE = {Jacobi computation using mobile agent}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {5}, PAGES = {392--401}, VOLUME = {1}, URL = {http://hal.archives-ouvertes.fr/hal-00612627/en/}, PDF = {http://hal.archives-ouvertes.fr/hal-00612627/PDF/ijcsit2010010515.pdf}, ABSTRACT = {Physical phenomena occur in a wide range of mathematical applications: from fluid to solid mechanics, electromagnetic and electrical engineering. Engineers working toward an optimized modelling must develop their software and physical system together. This development follows a standard life-cycle with design, coding and test. Validation is become quite complex and is subdivided into several parts: unit, integration, functional and system. Each piece of validation brings its brick. Entire system is tested as per the requirements. They are about numerical results, performance, architecture and fault tolerance. We defined a distributed architecture for numerical computation based on the use of mobile agents. A group or space of agents manages a whole computation, from its registration until its validation. Their role is multiple: they prepare input data and operate tasks but above they administer distributed architecture. The main impact is failure management. Failure can concern not only software services but also material. Also, the completion of an execution can need task recovery, anomaly reporting or favourite configuration. All these details consist of a main report about validation of distributed application though simulation.} } @ARTICLE{DBLP:journals/concurrency/FourneauMP10, AUTHOR = {Jean-Michel Fourneau and Lynda Mokdad and Nihal Pekergin}, JOURNAL = {Concurrency and Computation: Practice and Experience}, TITLE = {Stochastic bounds for performance evaluation of Web services}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {10}, PAGES = {1286--1307}, VOLUME = {22}, DOI = {10.1002/cpe.1580} } @ARTICLE{JACQUOT:2010:INRIA-00565772:1, AUTHOR = {Jean-Pierre Jacquot and Régine Laleau and Hassan Mountassir and Vincent Poirriez}, JOURNAL = {Génie logiciel}, TITLE = {Assemblage de composants digne de confiance : de l'expression des besoins aux spécifications formelles}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {95}, PAGES = {13--18}, OPTVOLUME = {}, URL = {http://hal.inria.fr/inria-00565772/en/}, ABSTRACT = {Le projet TACOS (Trustworthy Assembling of Components: frOm requirements to Specifications) propose une approche par composants pour la sp{\'e}cification de syst{\`e}mes s{\^u}rs, depuis l'expression des besoins jusqu'{\`a} une sp{\'e}cification formelle, en utilisant ou adaptant des langages et des outils existants. Le domaine d'application choisi est celui du transport. Les syst{\`e}mes de ce domaine, {\`a} la fois distribu{\'e}s et embarqu{\'e}s, n{\'e}cessitent l'expression de propri{\'e}t{\'e}s fonctionnelles et non fonctionnelles. Le projet vise {\`a} r{\'e}pondre aux questions suivantes : Comment prendre en compte des propri{\'e}t{\'e}s non-fonctionnelles d{\`e}s les premi{\`e}res {\'e}tapes du d{\'e}veloppement ? Comment exploiter la m{\'e}thode d'analyse des besoins KAOS (Knowledge Acquisition in Automated Specification) ? Est-il possible d'utiliser la m{\'e}thode formelle B avec des extensions et/ou en coop{\'e}ration avec d'autres formalismes tels de SysML, CSP ? Comment tenir compte des propri{\'e}t{\'e}s non-fonctionnelles dans les mod{\`e}les {\`a} composants comme Fractal ? Comment v{\'e}rifier la compatibilit{\'e} entre composants dans les mod{\`e}les d'interface ? Trois {\'e}tudes de cas ont {\'e}t{\'e} men{\'e}es pour le composant de localisation du v{\'e}hicule CyCab et du convoi de v{\'e}hicules (platooning).} } @ARTICLE{DBLP:journals/cuza/KlaudelKPP10, AUTHOR = {Hanna Klaudel and Maciej Koutny and Elisabeth Pelz and Franck Pommereau}, JOURNAL = {Sci. Ann. Comp. Sci.}, TITLE = {State Space Reduction for Dynamic Process Creation}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {131--157}, VOLUME = {20}, URL = {http://www.infoiasi.ro/bin/Annals/Article?v=XX&a=4} } @ARTICLE{konopacki10:_model, AUTHOR = {P. Konopacki and M. Frappier and R. Laleau}, JOURNAL = {RSTI - Ingénierie des Sysèmes d'Information (ISI)}, TITLE = {Modélisation de politiques de sécurité à l'aide d'une algèbre de processus}, YEAR = {2010}, OPTMONTH = {}, NOTE = {Hermes-Lavoisier}, NUMBER = {3}, OPTPAGES = {}, VOLUME = {15} } @ARTICLE{isse/Laleau2009, AUTHOR = {Régine Laleau and Farida Semmak and Abderrahman Matoussi and Dorian Petit and Ahmed Hammad and Bruno Tatibouet}, JOURNAL = {Innovations in Systems and Software Engineering}, TITLE = {A first attempt to combine SysML requirements diagrams and B}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {6}, PAGES = {47--54}, VOLUME = {1-2}, PUBLISHER = {Springer-Verlag}, DOI = {10.1007/s11334--009-0119-y} } @ARTICLE{DBLP:journals/concurrency/MokdadN10, AUTHOR = {Lynda Mokdad and Mirela Sechi Moretti Annoni Notare}, JOURNAL = {Concurrency and Computation: Practice and Experience}, TITLE = {Special Issue: Performance Evaluation of Communications in Distributed Systems and Web-Based Service Architectures}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {10}, PAGES = {1205--1206}, VOLUME = {22}, DOI = {10.1002/cpe.1575} } @ARTICLE{semmak10:_exten_kaos_method_model_variab_requir, AUTHOR = {Farida Semmak and Christophe Gnaho and Regine Laleau}, JOURNAL = {Communications in Computer and Information Science}, TITLE = {Extended KAOS Method to Model Variability in Requirements}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {193--205}, VOLUME = {69} } @ARTICLE{SPICHER:2010:INRIA-00546424:1, AUTHOR = {Antoine Spicher and Fatès, A., Nazim and Olivier Simonin}, JOURNAL = {Communications in Computer and Information Sciences series}, TITLE = {Translating Discrete Multi-Agents Models into Cellular Automata, Application to Diffusion-Limited Aggregation}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {270--282}, VOLUME = {67}, PUBLISHER = {Springer}, URL = {http://hal.inria.fr/inria-00546424/en/}, ABSTRACT = {Abstract. This paper deals with the synchronous implementation of situated Multi-Agent Systems (MAS) in order to have no execution bias and to ease their programming on massively parallel computing devices. For this purpose we investigate the translation of discreteMAS into Cellular Automata (CA). Contrarily to the sequential scheduling generally used in MAS simulations, CA are a model for massively parallel computing where the updating of the components is synchronous. However, CA expressiveness is limited and not always adapted to all types of modeling situations, especially when independent entities move in space. After illustrating these issues on a simple example, we propose a generic method to translate a discrete MAS into a CA, called a transactional CA. Our approach consists in using the influence-reaction model to perform this translation.}, DOI = {10.1007/978-3-642-11819-7} } @ARTICLE{Verlan2010, AUTHOR = {Sergey Verlan}, JOURNAL = {Computer Science Journal of Moldova}, TITLE = {Recent Developments on Insertion-Deletion Systems}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {210--245}, VOLUME = {18} } @ARTICLE{VAP10, AUTHOR = {Sergey Verlan and Artiom Alhazov and Ion Petre}, JOURNAL = {Biosystems}, TITLE = {A Sequence-Based Analysis of the Pointer Distribution of Stichotrichous Ciliates}, YEAR = {2010}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {109--16}, VOLUME = {101}, URL = {http://www.sciencedirect.com/science/article/B6T2K-505NS9K-2/2/2c6010f103fb019f9ec843d2749dd11d}, DOI = {10.1016/j.biosystems.2010.05.003} } @INPROCEEDINGS{ARV10, AUTHOR = {A. Alhazov and Y. Rogozhin and S. Verlan}, BOOKTITLE = {Proceedings of the Eleventh International Conference on Membrane Computing}, TITLE = {A Small Universal Splicing P System}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {67--74}, PUBLISHER = {Verlag ProBusiness Berlin}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{ASTDrodin2010, AUTHOR = {Paul Amar and Marc Frappier and Cecile Lartaud and Jeremy Milhau}, BOOKTITLE = {Rodin User and Developer Workshop}, TITLE = {Integrating ASTD in the Rodin Platform}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/mswim/Ben-OthmanDMY10, AUTHOR = {Jalel Ben-Othman and Serigne Diagne and Lynda Mokdad and Bashir Yahya}, BOOKTITLE = {13th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWiM)}, TITLE = {Performance evaluation of a hybrid MAC protocol for wireless sensor networks}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Violet R. Syrotiuk and Fatih Alagöz and Brahim Bensaou and Özgür B. Akan}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {327--334}, PUBLISHER = {ACM}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1145/1868521.1868574} } @INPROCEEDINGS{DBLP:conf/lcn/Ben-OthmanMC10, AUTHOR = {Jalel Ben-Othman and Lynda Mokdad and Mohamed Ould Cheikh}, BOOKTITLE = {35th Annual IEEE Conference on Local Computer Networks (LCN)}, TITLE = {On improving the performance of IEEE 802.11s based wireless mesh networks using directional antenna}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {785--790}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/LCN.2010.5735812} } @INPROCEEDINGS{DBLP:conf/globecom/Ben-OthmanMC10, AUTHOR = {Jalel Ben-Othman and Lynda Mokdad and Mohamed Ould Cheikh}, BOOKTITLE = {Global Communications Conference (GLOBECOM)}, TITLE = {Q-HWMP: Improving End-to-End QoS for 802.11s Based Mesh Networks}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1--6}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/GLOCOM.2010.5683584} } @INPROCEEDINGS{DBLP:journals/procedia/BenoitG10, AUTHOR = {Anne Benoit and Frédéric Gava}, BOOKTITLE = {International Conference of Computer Science (ICCS)}, TITLE = {Practical aspects of high-level parallel programming (PAPP)}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, OPTORGANIZATION = {}, PAGES = {2053--2054}, PUBLISHER = {Elsevier}, SERIES = {Procedia CS}, VOLUME = {1}, DOI = {10.1016/j.procs.2010.04.229} } @INPROCEEDINGS{scw10, AUTHOR = {Louis Bigo and Antoine Spicher and Olivier Michel}, BOOKTITLE = {Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems - Spatial Computing Workshop}, TITLE = {Spatial Programming for Music Representation and Analysis}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://www.lacl.fr/~michel/PUBLIS/2010/scw10.pdf}, ABSTRACT = {In this paper, we show how some musical objects and some algorithmic problems arising in musical theory can be rephrased in spatial terms. This leads to the development of meaningful spatial representations and of efficient spatial programs. The corresponding developments have been implemented in MGS, a rule-based spatial programming language.} } @INPROCEEDINGS{boukerche10:_apply, AUTHOR = {A. Boukerche and Y. Ren and L. Mokdad}, BOOKTITLE = {6th ACM workshop on QoS and security for wireless and mobile networks}, TITLE = {Applying symmetric and asymmetric key algorithms for the security in wireless networks: proof of correctness}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {ACM Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{BOUSDIRA:2010:INRIA-00515223:1, AUTHOR = {Wadoud Bousdira and Frédéric Gava and Louis Gesbert and Frédéric Loulergue and Guillaume Petiot}, BOOKTITLE = {2nd International Workshop on Parallel and Distributed Algorithms and Applications (PDAA)}, TITLE = {Functional Parallel Programming with Revised Bulk Synchronous Parallel ML}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Koji Nakano}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.inria.fr/inria-00515223/en/}, ABSTRACT = {Bulk Synchronous Parallel ML or BSML is a high-level language for programming parallel algorithms. Built upon the Objective Caml language, it provides a safe setting for implementing Bulk Synchronous Parallel (BSP) algorithms. It avoids concurrency related problems: deadlocks and non- determinism. BSML is based on a very small core of parallel primitives that extended functional sequential programming to functional BSP programming with a parallel data structure and operations to manipulate it. However, in practice the primitives for writing the parallel non-communicating parts of the program are not so easy to use. Thus we designed a new syntax that makes programs easier to write and read. Revised BSML is presented and its expressiveness and performance are illustrated through an application example.} } @INPROCEEDINGS{DBLP:conf/birthday/BesR10, AUTHOR = {Alexis Bès and Alexander Rabinovich}, BOOKTITLE = {Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday}, TITLE = {Decidable Expansions of Labelled Linear Orderings}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Andreas Blass and Nachum Dershowitz and Wolfgang Reisig}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {95--107}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {6300}, DOI = {10.1007/978-3-642-15025-8_5} } @INPROCEEDINGS{DBLP:conf/iscis/Castel-TalebFP10, AUTHOR = {Hind Castel-Taleb and Jean-Michel Fourneau and Nihal Pekergin}, BOOKTITLE = {Computer and Information Science}, TITLE = {Stochastic comparisons applied to G-Networks with catastrophes}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Erol Gelenbe and Ricardo Lent and Georgia Sakellari and Ahmet Sacan and Ismail Hakki Toroslu and Adnan Yazici}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {57--60}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Electrical Engineering}, VOLUME = {62}, URL = {http://hal-institut-telecom.archives-ouvertes.fr/hal-00545738/en/}, ABSTRACT = {We study the transient distribution of some G-networks of queues with customers and signals. After its service completion a customer moves to another queue and may become a signal. We consider catastrophes where the signal deletes all customers in a queue. Both networks with negative customers and with catastrophes belong to well known of Gelenbe's networks with product form steady-state distribution. As the transient distribution is impossible to obtain, we derive stochastic upper and lower bounds on the marginal distribution for each queue following Massey's approach.}, DOI = {10.1007/978-90-481-9794-1_11} } @INPROCEEDINGS{DBLP:conf/asmta/Castel-TalebIP10, AUTHOR = {Hind Castel-Taleb and Idriss Ismael-Aouled and Nihal Pekergin}, BOOKTITLE = {17th International Conference on Analytical and Stochastic Modeling Techniques and Applications (ASMTA)}, TITLE = {Stochastic Comparisons for Performability of Telecommunication Systems}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Khalid Al-Begain and Dieter Fiems and William J. Knottenbelt}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {189--203}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {6148}, ABSTRACT = {In this paper, we study the performability of telecommunication systems. Performability verification may be very complex as it is the joint evaluation of performance and dependability. We consider the composite Erlang loss model representing a telecommunication switching system. In this model we suppose that each channel can be free/busy for the performance behavior, and also in a failure/repair state for the availability. We suppose that the system is represented by a multidimensional Markov chain whose size increases quickly with the number of channels. We apply stochastic comparison methods in order to define bounding systems easier to analyze. Different approaches have been used. In the first one, we modify the exact system in order to obtain a bounding system having a product form solution. The other systems are obtained by reducing the size of the exact system, by aggregating the states in order to obtain bounding systems. We compute upper and lower bounds on the blocking probability, and we study the impact of parameters on the quality of the bounds.}, DOI = {10.1007/978-3-642-13568-2_14} } @INPROCEEDINGS{DBLP:conf/mmb/Castel-TalebP10, AUTHOR = {Hind Castel-Taleb and Nihal Pekergin}, BOOKTITLE = {15th International GI/ITG Conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance (MMB/DFT)}, TITLE = {Accuracy of Strong and Weak Comparisons for Network of Queues}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Bruno Müller-Clostermann and Klaus Echtle and Erwin P. Rathgeb}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {212--226}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {5987}, URL = {http://hal-institut-telecom.archives-ouvertes.fr/hal-00545740/en/}, ABSTRACT = {Quality of performance measure bounds is crucial for an accurate dimensioning of computer network resources. We study stochastic comparisons of multidimensional Markov processes for which quantitative analysis could be intractable if there is no specific solution form. On partially ordered state space, different stochastic orderings can be defined as the strong or the less constrained weak ordering. The goal of the present paper is to compare these two orderings with respect the quality of derived bounds. We propose to study a system similar to a Jackson network except that queues have finite capacity. Different bounding systems are built either in the sense of the strong ordering with hard constraints, or in the sense of the weak ordering with less ones. The proofs of the stochastic comparisons are done using the coupling and the increasing set methods, with an intuitive event based formalism. The qualities of bounding systems are compared regarding to blocking probabilities.}, DOI = {10.1007/978-3-642-12104-3_17} } @INPROCEEDINGS{CERVELLE:2010:INRIA-00455807:1, AUTHOR = {Julien Cervelle and Enrico Formenti and Pierre Guillon}, BOOKTITLE = {27th International Symposium on Theoretical Aspects of Computer Science (STACS)}, TITLE = {Ultimate Traces of Cellular Automata}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Jean-Yves Marion and Thomas Schwentick}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {155-166}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://hal.archives-ouvertes.fr/inria-00455807/PDF/cervelle.pdf} } @INPROCEEDINGS{CVV10, AUTHOR = {E. Csuhaj-Varjú and G. Vaszil and S. Verlan}, BOOKTITLE = {Proceedings of the Eleventh International Conference on Membrane Computing}, TITLE = {On Generalized Communicating P Systems with One Symbol}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {137--154}, PUBLISHER = {Verlag ProBusiness Berlin}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{cegielski10:_introd, AUTHOR = {Patrick Cégielski}, BOOKTITLE = {Studies in Weak Arithmetics}, TITLE = {Introduction to weak arithmetics}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {196}, OPTORGANIZATION = {}, PAGES = {1--12}, PUBLISHER = {CSLI Publications, Stanford}, SERIES = {Lecture Notes}, OPTVOLUME = {} } @INPROCEEDINGS{cegielski10:_normal_some_exten_abstr_state_machin, AUTHOR = {Patrick Cégielski and Irène Guessarian}, BOOKTITLE = {Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion to His 70th Birthday}, TITLE = {Normalization of Some Extended Abstract State Machines}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {6300}, OPTORGANIZATION = {}, PAGES = {100-116}, PUBLISHER = {Springer}, SERIES = {LNCS}, OPTVOLUME = {} } @INPROCEEDINGS{MAT-ISCIS2010, AUTHOR = {Thu-Ha Dao-Thi and Jean-Michel Fourneau and Minh-Anh Tran}, BOOKTITLE = {Proceedings of the 25th International Symposium on Computer and Information Sciences}, TITLE = {Multiple Class Symmetric G-networks with Phase Type}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {72--86}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Electrical Engineering}, VOLUME = {62}, DOI = {10.1007/978-3-642-13568-2_6} } @INPROCEEDINGS{DBLP:conf/asmta/Dao-ThiFT10, AUTHOR = {Thu-Ha Dao-Thi and Jean-Michel Fourneau and Minh-Anh Tran}, BOOKTITLE = {17th International Conference on Analytical and Stochastic Modeling Techniques and Applications (ASMTA)}, TITLE = {Networks of Symmetric Multi-class Queues with Signals Changing Classes}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Khalid Al-Begain and Dieter Fiems and William J. Knottenbelt}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {72--86}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {6148}, DOI = {10.1007/978-3-642-13568-2_6} } @INPROCEEDINGS{dima-gandalf:2010, AUTHOR = {C. Dima and C. Enea and D. Guelev}, BOOKTITLE = {First Symposium on Games, Automata, Logic, and Formal Verification (Gandalf)}, TITLE = {Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Angelo Montanari and Margherita Napoli and Mimmo Parente}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {103--117}, OPTPUBLISHER = {}, SERIES = {Electronic Proceedings in Theoretical Computer Science}, VOLUME = {25} } @INPROCEEDINGS{DUMONT:2010:HAL-00514538:1, AUTHOR = {Cyril Dumont and Fabrice Mourlin}, BOOKTITLE = {Proceeding of the 8th International Conference of Modeling and Simulation (MOSIM'10)}, TITLE = {Adaptive runtime for numerical code}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00514538/en/}, PDF = {http://hal.archives-ouvertes.fr/hal-00514538/PDF/mosim10.pdf}, ABSTRACT = {A strategy for the analytical solving of ordinary differential equations and a first implementation of it based on mobile agent community, using jini Numerical algorithms are already designed in many domains such that electromagnetism, fluid theory. Numerical codes were developed from these mathematical analyses with interesting performance. Our work is about our runtime platform to execute existing numerical codes by the use of mobile agents. They act as workers which manage parts of a numerical code on a set of computers.} } @INPROCEEDINGS{DUMONT:2010:HAL-00612682:1, AUTHOR = {Cyril Dumont and Fabrice Mourlin}, BOOKTITLE = {Sophia-Antipolis Formal Analysis Workshop}, TITLE = {Model checking applied to mobile agent system}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {2p}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00612682/en/}, PDF = {http://hal.archives-ouvertes.fr/hal-00612682/PDF/03_Dumont_SAFA2010_final.pdf}, ABSTRACT = {The subject of this contribution is about use of formal specification in order to prove business properties of a mobile agent system. First, we can be described this kind of system by the use of process algebra, in particular the $\pi$-calculus language. Then, from such formal specification, we can generate semi automatically automata using an XML transformation. Finally, we compute acceptance graph to validate a formal property. This validation is assisted by the use of a tool such Uppaal from Aalborg university.} } @INPROCEEDINGS{embe-jiague10:_model_driven_engin_of_funct_secur_polic, AUTHOR = {Michel Embe-Jiague and Marc Frappier and Frederic Gervais and Pierre Konopacki and Regine Laleau and Jeremy Milhau and Richard St-Denis}, BOOKTITLE = {12th International Conference on Enterprise Information Systems (ICEIS)}, TITLE = {Model-Driven Engineering of Functional Security Policies}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {374--379}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{embe-jiague10:_from_astd_acces_contr_polic, AUTHOR = {Michel Embe-Jiague and Richard St-Denis and Marc Frappier and Frederic Gervais and Regine Laleau}, BOOKTITLE = {1st International Symposium on Web Intelligent Systems & Services (WISS 2010)}, TITLE = {From ASTD access control policies to WSBPEL processes deployed in a SOA environment}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {15 pages}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, OPTVOLUME = {} } @INPROCEEDINGS{FG2010:HLPP, AUTHOR = {J. Fortin and F. Gava}, BOOKTITLE = {4th International Workshop on High-level Parallel Programming and Applications (HLPP 2010, affiliated to conference ICFP 2010)}, TITLE = {BSP-Why: an intermediate language for deductive verification of BSP programs}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {to appear}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {ACM Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{GF2010:ICCS, AUTHOR = {J. Fortin and F. Gava}, BOOKTITLE = {ICCS}, TITLE = {From BSP Routines to High-performance ones: Formal Verification of a Transformation Case}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {to appear}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{FKRV10, AUTHOR = {Rudolf Freund and Marian Kogler and Yurii Rogozhin and Sergey Verlan}, BOOKTITLE = {Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems}, TITLE = {Graph-Controlled Insertion-Deletion Systems}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {88--98}, OPTPUBLISHER = {}, OPTSERIES = {}, VOLUME = {31} } @INPROCEEDINGS{GGP2010:PDMC, AUTHOR = {F. Gava and M. Guedj and F. Pommereau}, BOOKTITLE = {9th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC, affiliated to conference SPIN 2010)}, TITLE = {A BSP algorithm for the state space construction of security protocols}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {to appear}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{ghazal10:_fair_effic_sched_schem_real, AUTHOR = {S. Ghazal and L. Mokdad and J. Ben othman}, BOOKTITLE = {4 th International Workshop on Verification and Evaluation of Computer and Communication Systems (Vecos)}, TITLE = {A Fair and Efficient Scheduling Scheme for Real and non-Real-Time Traffic Flows in WiMAX}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1--8}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{GRIGORIEFF:2010:INRIA-00455373:1, AUTHOR = {Serge Grigorieff and Pierre Valarcher}, BOOKTITLE = {27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010}, TITLE = {Evolving MultiAlgebras unify all usual sequential computation models}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Jean-Yves Marion and Thomas Schwentick}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {417--428}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, KEYWORDS = {Abstract state machines, Models of machines, Computability, Universality, Logic in computer science, Theory of algorithms}, URL = {http://hal.inria.fr/inria-00455373/en/}, PDF = {http://hal.inria.fr/inria-00455373/PDF/grigorieff.pdf}, ABSTRACT = {It is well-known that Abstract State Machines (ASMs) can simulate "step-by-step" any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) simulation is not identification, 2) the ASMs simulating machines of some type do not constitute a natural class among all ASMs. We modify Gurevich's notion of ASM to that of EMA ("Evolving MultiAlgebra") by replacing the program (which is a syntactic object) by a semantic object: a functional which has to be very simply definable over the static part of the ASM. We prove that very natural classes of EMAs correspond via "literal identifications" to slight extensions of the usual machine models and also to grammar models. Though we modify these models, we keep their computation approach: only some contingencies are modified. Thus, EMAs appear as the mathematical model unifying all kinds of sequential computation paradigms.} } @INPROCEEDINGS{DBLP:conf/stacs/GrigorieffV10, AUTHOR = {Serge Grigorieff and Pierre Valarcher}, BOOKTITLE = {27th International Symposium on Theoretical Aspects of Computer Science (STACS)}, TITLE = {Evolving Multialgebras Unify All Usual Sequential Computation Models}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Jean-Yves Marion and Thomas Schwentick}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {417--428}, PUBLISHER = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, SERIES = {LIPIcs}, VOLUME = {5}, DOI = {10.4230/LIPIcs.STACS.2010.2473} } @INPROCEEDINGS{DBLP:conf/iscc/HaddadMY10, AUTHOR = {Serge Haddad and Lynda Mokdad and Samir Youcef}, BOOKTITLE = {15th IEEE Symposium on Computers and Communications (ISCC)}, TITLE = {Response time of BPEL4WS constructors}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {695--700}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/ISCC.2010.5546538} } @INPROCEEDINGS{DBLP:conf/bpsc/HaddadMY10, AUTHOR = {Serge Haddad and Lynda Mokdad and Samir Youcef}, BOOKTITLE = {INFORMATIK - Business Process and Service Science - (ISSS/BPSC)}, TITLE = {Selection of the Best composite Web Service Based on Quality of Service}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Witold Abramowicz and Rainer Alt and Klaus-Peter Fähnrich and Bogdan Franczyk and Leszek A. Maciaszek}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {255--266}, PUBLISHER = {GI}, SERIES = {LNI}, VOLUME = {177} } @INPROCEEDINGS{DBLP:conf/iscc/KasseMY10, AUTHOR = {Youssou Kasse and Lynda Mokdad and Samir Youcef}, BOOKTITLE = {15th IEEE Symposium on Computers and Communications (ISCC)}, TITLE = {Stochastic bounds for end-to-end delay}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1127--1132}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/ISCC.2010.5546616} } @INPROCEEDINGS{MASHKOOR:2010:HAL-00431272:1, AUTHOR = {Atif Mashkoor and Abderrahman Matoussi}, BOOKTITLE = {The Second International Conference on ASM, Alloy, B and Z - ABZ 2010}, TITLE = {Towards validation of requirements models}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {404}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {5977}, URL = {http://hal.archives-ouvertes.fr/hal-00431272/en/}, PDF = {http://hal.archives-ouvertes.fr/hal-00431272/PDF/main.pdf}, ABSTRACT = {The aim of this paper is to gradually introduce formalism in the requirement engineering phase in order to facilitate its validation. We analyze and elicit our requirements with KAOS, specify them into Event-B language, and then use the animation technique to rigourously validate the derived formal specification and consequently its semi-formal counterpart goal model against original customers' requirements.}, DOI = {10.1007/978-3-642-11811-1_38} } @INPROCEEDINGS{DBLP:conf/asm/MichelGV10, AUTHOR = {David Michel and Frédéric Gervais and Pierre Valarcher}, BOOKTITLE = {Second International Conference on Abstract State Machines, Alloy, B and Z (ASM)}, TITLE = {B-ASM: Specification of ASM à la B}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Marc Frappier and Uwe Glässer and Sarfraz Khurshid and Régine Laleau and Steve Reeves}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {391}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {5977}, DOI = {10.1007/978-3-642-11811-1_29} } @INPROCEEDINGS{milh10:_system_trans_rules_from_astd, AUTHOR = {Jérémy Milhau and Marc Frappier and Frédéric Gervais and Régine Laleau}, BOOKTITLE = {8th International Conference on Integrated Formal Methods (IFM)}, TITLE = {Systematic Translation Rules from ASTD to Event-B}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {245--259}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {6396}, ABSTRACT = {This article presents a set of translation rules to generate Event-B machines from process-algebra based specification languages such as astd. Illustrated by a case study, it details the rules and the process of the translation. The ultimate goal of this systematic translation is to take advantage of Rodin, the Event-B platform to perform proofs, animation and model-checking over the translated specification.}, DOI = {10.1007/978-3-642-16265-7_18} } @INPROCEEDINGS{DBLP:conf/vtc/MiraniBT10, AUTHOR = {Farhan H. Mirani and Nadia Boukhatem and Minh-Anh Tran}, BOOKTITLE = {Proceedings of the 72nd IEEE Vehicular Technology Conference (VTC Fall)}, TITLE = {A Data-Scheduling Mechanism for Multi-Homed Mobile Terminals with Disparate Link Latencies}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1--5}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/VETECF.2010.5594280} } @INPROCEEDINGS{MIRANI:2010:HAL-00626814:1, AUTHOR = {Farhan Hyder Mirani and Minh Anh, Tran and Nadia Boukhatem}, BOOKTITLE = {Proceedings of 72nd IEEE Vehicular Technology Conference Fall (VTC 2010-Fall)}, TITLE = {A Data-Scheduling Mechanism for Multi-Homed Mobile Terminals with Disparate Link Latencies}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1--5}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, KEYWORDS = {Delay, Mobile communication, Protocols, Receivers, Scheduling, Throughput}, URL = {http://hal.upmc.fr/hal-00626814/en/}, ABSTRACT = {A mobile terminal equipped with multiple network interfaces can often be found under coverage of multiple access networks. Multihoming enables mobile terminals to communicate simultaneously through multiple interfaces. Connection-oriented transport layer mechanisms ensure reliable, in-order delivery of data, however parallel data transfers in multihoming face problems due to out-of-order reception of data which causes fast-retransmissions and limit the communication throughput. In this paper, we propose a transport layer based mechanism which stripes one flow''s data across multiple disjoint paths efficiently, reducing possible occurrence of out-of-order data. Our mechanism estimates arrival times of data packets to be sent through available paths in an association, and decides which packets are to be sent through each path. We compared our mechanism with a relatively closer approach called Westwood SCTP. We illustrate with the help of simulation results that our mechanism proves to improve multipath communication.} } @INPROCEEDINGS{MIRANI:2010:HAL-00626812:1, AUTHOR = {Farhan Hyder Mirani and Minh Anh, Tran and Nadia Boukhatem}, BOOKTITLE = {Proceedings of the 6th International Wireless Communications and Mobile Computing Conference}, TITLE = {Intelligent data-striping: a predictive scheduling mechanism}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {949--953}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.upmc.fr/hal-00626812/en/}, ABSTRACT = {New-age mobile devices are often equipped with multiple network interfaces, which can be exploited simultaneously by sharing a single traffic load over more than one available path. However, parallel data transfers introduce a serious risk to in-order data delivery for transport layer primitives. This is principally due to the difference in characteristics of one path from the other. It becomes crucial that the data be received in-order to avoid fast-retransmissions and head-of-line blocking problem at the transport layer. In this paper, we propose an intelligent transport layer scheduling mechanism which stripes data from one flow to multiple distinct paths and aggregates available resources efficiently. Our mechanism first estimates the arrival times of each packet to be received at the receiver. It then schedules the outgoing packets in a way as to avoid data re-ordering at the receiver. Simulation results show that our mechanism efficiently reduces out-of-order data delivery at reception. Comparing our proposal with Concurrent Multipath Transfer (CMT), an SCTP based load-sharing technique; we show that it outperforms CMT in case of disparate path delays.} } @INPROCEEDINGS{DBLP:conf/iwcmc/MiraniTB10, AUTHOR = {Farhan H. Mirani and Minh-Anh Tran and Nadia Boukhatem}, BOOKTITLE = {Proceedings of the 6th International Wireless Communications and Mobile Computing Conference (IWCMC)}, TITLE = {Intelligent data-striping: a predictive scheduling mechanism}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Ahmed Helmy and Peter Mueller and Yan Zhang}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {949--953}, PUBLISHER = {ACM}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1145/1815396.1815613} } @INPROCEEDINGS{DBLP:conf/aiccsa/MokdadBC10, AUTHOR = {Lynda Mokdad and Jalel Ben-Othman and Mohamed Ould Cheikh}, BOOKTITLE = {8th ACS/IEEE International Conference on Computer Systems and Applications (AICCSA)}, TITLE = {Improving QoS for BE traffics in WIMAX networks}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1--5}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://doi.ieeecomputersociety.org/10.1109/AICCSA.2010.5587004} } @INPROCEEDINGS{MUZY:2010:HAL-00465463:1, AUTHOR = {Alexandre Muzy and Luc Touraille and Hans Vangheluwe and Olivier Michel and Kaba Traoré, Mamadou and R.C. Hill, David}, BOOKTITLE = {Spring Simulation Multi-Conference Symposium On Theory of Modeling and Simulation - (DEVS) Integrative M & S Symposium}, TITLE = {Activity Regions for the Specification of Discrete Event Systems}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {176--182}, PUBLISHER = {ACM, SCS CNRS}, OPTSERIES = {}, OPTVOLUME = {}, KEYWORDS = {Modeling and simulation, Discrete Event System, Activity paradigm.}, PDF = {http://www.lacl.fr/~michel/PUBLIS/2010/devs2010.pdf}, ABSTRACT = {{T}he common view on modeling and simulation of dynamic systems is to focus on the specification of the state of the system and its transition function. {A}lthough some interesting challenges remain to efficiently and elegantly support this view, we consider in this paper that this problem is solved. {I}nstead, we propose here to focus on a new point of view on dynamic system specifications: the activity exhibited by their discrete event simulation. {W}e believe that such a viewpoint introduces a new way for analyzing, modeling and simulating systems. {W}e first start with the definition of the key notion of activity for the specification of a specific class of dynamic system, namely discrete event systems. {T}hen, we refine this notion to characterize activity regions in time, in space, in states and in hierarchical component-based models. {E}xamples are given to illustrate and stress the importance of this notion.} } @INPROCEEDINGS{othman10:_improuv_wirel_mesh_networ, AUTHOR = {J. Ben Othman and L. Mokdad and M. Ould cheikh}, BOOKTITLE = {Local Computer Networks (LCN)}, TITLE = {Improuving end to end delay over Wireless Mesh Network (802.11s) based on sectorial coverage}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {801--806}, PUBLISHER = {IEEE computer society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{rabih10:_stead_state_proper_verif, AUTHOR = {Diana El Rabih and Gael Gorgo and Nihal Pekergin and Jean-Marc Vincent}, BOOKTITLE = {4th International Workshop on Verification and Evaluation of Computer and Communication Systems (VECOS 2010)}, TITLE = {Steady State Property Verification: a Comparison Study}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {eWic, British Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://www.bcs.org/server.php?show=conWebDoc.36156} } @INPROCEEDINGS{DBLP:conf/lcn/RenBM10, AUTHOR = {Yonglin Ren and Azzedine Boukerche and Lynda Mokdad}, BOOKTITLE = {35th Annual IEEE Conference on Local Computer Networks (LCN)}, TITLE = {A novel framework of secure network management for wireless and mobile networks}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {676--683}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/LCN.2010.5735793} } @INPROCEEDINGS{SaMiFrFrGeLa:2010:AFADL, AUTHOR = {Kevin Salabert and Jérémy Milhau and Benoît Fraikin and Marc Frappier and Frédéric Gervais and Régine Laleau}, BOOKTITLE = {Atelier Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL)}, TITLE = {iASTD : un interpréteur pour les ASTD}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {3--6}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{COLSEC10, AUTHOR = {Sam Sanjabi and Franck Pommereau}, BOOKTITLE = {Workshop on Collaboration and Security (COLSEC'10)}, TITLE = {Modelling, Verification, and Formal Analysis of Security Properties in a P2P System}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1-10}, PUBLISHER = {IEEE}, SERIES = {IEEE Digital Library}, OPTVOLUME = {}, KEYWORDS = {privacy protection for collaborative systems, security for specific collaboration domains (P2P), security in collaborative multi-agent systems, secure collaboratove agents, middleware security} } @INPROCEEDINGS{icgt10, AUTHOR = {Antoine Spicher and Olivier Michel and Jean-Louis Giavitto}, BOOKTITLE = {International Conference on Graph Transformation}, TITLE = {Declarative Mesh Subdivision Using Topological Rewriting in MGS}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {298--313}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {6372}, PDF = {http://www.lacl.fr/~michel/PUBLIS/2010/icgt2010.pdf}, ABSTRACT = {Mesh subdivision algorithms are usually specified informally using graphical schemes defining local mesh refinements. These algorithms are then implemented efficiently in an imperative framework. The implementation is cumbersome and implies some tricky indices management. Smith et al. (2004) asks the question of the declarative programming of such algorithms in an index-free way. In this paper, we positively answer this question by presenting a rewriting framework where mesh refinements are described by simple rules. This framework is based on a notion of topological chain rewriting. Topological chains generalize the notion of labeled graph to higher dimensional objects. This framework has been implemented in the domain specific language MGS. The same generic approach has been used to implement Loop as well as Butterfly, Catmull-Clark and Kobbelt subdivision schemes.} } @INPROCEEDINGS{tan10:_modul_implem_dense_matrix_operat, AUTHOR = {S. Tan and F. Gava}, BOOKTITLE = {HPCS}, TITLE = {Modular Implementation of Dense Matrix Operations in a High-level BSP Language}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/icc/TranTB10, AUTHOR = {Minh-Anh Tran and Phuoc Nguyen Tran and Nadia Boukhatem}, BOOKTITLE = {Proceedings of IEEE International Conference on Communications (ICC)}, TITLE = {Strategy Game for Flow/Interface Association in Multi-Homed Mobile Terminals}, YEAR = {2010}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1--6}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5497983}, DOI = {10.1109/ICC.2010.5502485} } @TECHREPORT{TR-LACL-2010-11, AUTHOR = {Emil-Mircea ANDRIESCU and Anis AZZABI and Gaetan Hains}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (UPEC-Paris 12)}, TITLE = {Parallel processing of Forward XPath queries: an experiment with BSML}, YEAR = {2010}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2010-11}, OPTTYPE = {}, PDF = {http://lacl.fr/Rapports/TR/TR-LACL-2010-11.pdf} } @TECHREPORT{TR-LACL-2010-4, AUTHOR = {Muath Alrammal and Gaétan Hains and Mohamed Zergaoui}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A portable and extensible performance model for stream-processing of XPath queries}, YEAR = {2010}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2010-4}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2010-4.pdf} } @TECHREPORT{TR-LACL-2010-08, AUTHOR = {Paolo Ballarini and Hilal Djafri and Marie Duflot and Serge Haddad and Nihal Pekergin}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), Universit y of Paris-Est}, TITLE = {CSL^LHA: an Expressive Language for Statistical Verification of Stochastic Models}, YEAR = {2010}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2010-8}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2010-8.pdf} } @TECHREPORT{TR-LACL-2010-3, AUTHOR = {René David and Pierre Valarcher}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), Université of Paris-Est}, TITLE = {Trace of some primitive recursive schema}, YEAR = {2010}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2010-3}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2010-3.pdf} } @TECHREPORT{TR-LACL-2010-5, AUTHOR = {J. Fortin and F. Gava}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (UPEC)}, TITLE = {BSP-WHY: an intermediate language for deductive verification of BSP programs}, YEAR = {2010}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2010-5}, OPTTYPE = {}, PDF = {http://lacl.fr/Rapports/TR/TR-LACL-2010-5.pdf} } @TECHREPORT{TR-LACL-2010-09, AUTHOR = {F. Gava and M. Guedj and F. Pommereau}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est}, TITLE = {A BSP algorithm for the state space construction of security protocols}, YEAR = {2010}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2010-9}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2010-9.pdf} } @TECHREPORT{TR-LACL-2010-6, AUTHOR = {Pierre Konopacki and Marc Frappier and Regine Laleau}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Expressing access control policies with an event-based approach}, YEAR = {2010}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2010-6}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2010-6.pdf} } @TECHREPORT{TR-LACL-2010-12, AUTHOR = {Chong Li and G. Hains}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (UPEC-Paris 12)}, TITLE = {A simple Bridging Model for High-Performance Computing}, YEAR = {2010}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2010-12}, OPTTYPE = {}, PDF = {http://lacl.fr/Rapports/TR/TR-LACL-2010-12.pdf} } @TECHREPORT{TR-LACL-2010-1, AUTHOR = {Abderrahman Matoussi and Frederic Gervais and Regine Laleau}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {An Event-B formalization of KAOS goal refinement patterns}, YEAR = {2010}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2010-1}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2010-1.pdf} } @TECHREPORT{TR-LACL-2010-7, AUTHOR = {Diana El Rabih and Gael Gorgo and Nihal Pekergin and Jean-Marc Vincent}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-East (UPEC)}, TITLE = {Steady-state dependability verification by perfect sampling: Comparison study}, YEAR = {2010}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2010-7}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2010-7.pdf} } @TECHREPORT{TR-LACL-2010-10, AUTHOR = {Diana El Rabih and Gael Gorgo and Nihal Pekergin and Jean-Marc Vincent}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Steady-state dependability verification for very large systems}, YEAR = {2010}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2010-10}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2010-10.pdf} } @TECHREPORT{TR-LACL-2010-2, AUTHOR = {S. Sanjabi and F. Pommereau}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), Univer sity of Paris-Est (UPEC)}, TITLE = {Modelling, Verification, and Formal Analysis of Security Properties in a P2P System}, YEAR = {2010}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2010-2}, OPTTYPE = {}, PDF = {http://lacl.u-pec.fr/Rapports/TR/TR-LACL-2010-2.pdf} } @UNPUBLISHED{CARMONA:2010:HAL-00536047:1, AUTHOR = {Mikael Carmona and Olivier Michel and Jean-Louis Lacoume and Nathalie Sprynski and Barbara Nicolas}, NOTE = {24 pages}, TITLE = {Passive tomography for elastic waves in solids}, OPTMONTH = {}, YEAR = {2010}, URL = {http://hal.archives-ouvertes.fr/hal-00536047/en/}, ABSTRACT = {In this paper we derive relations between the cross-correlation of ambient noises recorded at two different points and the Green's function of the elastic waves in a medium with viscous damping. The Green's function allows to estimate physical parameters such as speeds or distances. Furthermore, this work is extended by introducing the Green's correlation function proposed by J-L. Lacoume in [Lacoume07]. Some recent works proved the possible reconstruction of the Green's function for scalar waves from the cross-correlation function of ambient noise. In this work, we consider vector waves propagating in a three dimensional solid medium. Two approaches are developed. Firstly, we extend theoretical derivations proposed by Y. Colin de Verdi`ere in [ColinDeVerdiere09], relating cross-correlation of scalar waves to 1D Green's function using linear operator theory. The second approach recasts the three dimensional problem in the framework of Fourier theory. This allows to improve physical understanding of the underlying physical processes as outlined in [Lacoume07].} } @UNPUBLISHED{COHEN:2010:HAL-00482002:1, AUTHOR = {Julien Cohenn and Jean-Louis Giavitto and Olivier Michel}, NOTE = {33 pages}, TITLE = {Variable elimination for building interpreters}, OPTMONTH = {}, YEAR = {2010}, KEYWORDS = {higher-order abstract syntax, combinatory logic, interpreter implementation}, URL = {http://hal.archives-ouvertes.fr/hal-00482002/en/}, PDF = {http://hal.archives-ouvertes.fr/hal-00482002/PDF/article.pdf}, ABSTRACT = {{I}n this paper, we build an interpreter by reusing host language functions instead of recoding mechanisms of function application that are already available in the host language (the language which is used to build the interpreter). {I}n order to transform user-defined functions into host language functions we use combinatory logic : lambda-abstractions are transformed into a composition of combinators. {W}e provide a mechanically checked proof that this step is correct for the call-by-value strategy with imperative features.} } @UNPUBLISHED{COHEN:2010:HAL-00482002:1, AUTHOR = {Julien Cohenn and Jean-Louis Giavitto and Olivier Michel}, NOTE = {33 pages}, TITLE = {Variable elimination for building interpreters}, OPTMONTH = {}, YEAR = {2010}, KEYWORDS = {higher-order abstract syntax, combinatory logic, interpreter implementation}, URL = {http://hal.archives-ouvertes.fr/hal-00482002/en/}, PDF = {http://hal.archives-ouvertes.fr/hal-00482002/PDF/article.pdf}, ABSTRACT = {In this paper, we build an interpreter by reusing host language functions instead of recoding mechanisms of function application that are already available in the host language (the language which is used to build the interpreter). In order to transform user-defined functions into host language functions we use combinatory logic : lambda-abstractions are transformed into a composition of combinators. We provide a mechanically checked proof that this step is correct for the call-by-value strategy with imperative features.} } @PHDTHESIS{BERNICHI:2009:TEL-00480718:1, AUTHOR = {Mâamoun Bernichi}, SCHOOL = {Université Paris-Est}, TITLE = {Surveillance logicielle à base d'une communauté d'agents mobiles}, YEAR = {2009}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, OPTTYPE = {}, KEYWORDS = {Agent mobile, Communauté, Surveillance logicielle, Communication, Collecte des données, Jini, Modèle de corrélation, IDS}, URL = {http://tel.archives-ouvertes.fr/tel-00480718/en/}, PDF = {http://tel.archives-ouvertes.fr/tel-00480718/PDF/2009PEST0019_0_0.pdf}, ABSTRACT = {{L}es agents mobiles peuvent physiquement migrer {\`a} travers un r{\'e}seau informatique dans le but d'effectuer des t{\^a}ches sur des machines, ayant la capacit{\'e} de leur fournir un support d'ex{\'e}cution. {C}es agents sont consid{\'e}r{\'e}s comme composants autonomes, une propri{\'e}t{\'e} qui leur permet de s'adapter {\`a} des environnements dynamiques {\`a} l'{\'e}chelle d'un r{\'e}seau large. {I}ls peuvent {\'e}galement {\'e}changer des informations entre eux afin de collaborer au sein de leur groupe, nous parlerons ainsi d'une communaut{\'e} d'agents mobiles. {N}ous avons d{\'e}velopp{\'e} ce concept de communaut{\'e}, en se r{\'e}f{\'e}rant aux recherches et aux {\'e}tudes pr{\'e}c{\'e}dentes pour d{\'e}finir un nouveau mod{\`e}le comportemental d'agent mobile. {C}e mod{\`e}le est utilis{\'e} pour r{\'e}pondre aux besoins de la surveillance logicielle. {C}elle ci consiste {\`a} collecter des {\'e}v{\'e}nements {\`a} partir de plusieurs sources de donn{\'e}es ({L}og, {\'e}v{\'e}nements syst{\`e}me...) en vue de leur analyse pour pouvoir d{\'e}tecter des {\'e}v{\'e}nements anormaux. {C}ette d{\'e}marche de surveillance s'appuie sur plusieurs types d'agents mobiles issus du m{\^e}me mod{\`e}le. {C}haque type d'agent g{\`e}re un domaine fonctionnel pr{\'e}cis. {L}'ensemble des ces agents constitue une communaut{\'e} pouvant collaborer avec diff{\'e}rentes autres communaut{\'e}s lorsqu'il existe plusieurs sites {\`a} surveiller. {L}es r{\'e}sultats de cette approche nous ont permis d'{\'e}voquer les limites li{\'e}es {\`a} la taille des donn{\'e}es collect{\'e}es, ce qui nous am{\`e}ne {\`a} de nouvelles perspectives de recherche et {\`a} penser un agent mobile "id{\'e}al". {E}nfin, nous nous int{\'e}ressons {\'e}galement {\`a} l'application de la communaut{\'e} d'agent mobile pour les syst{\`e}mes de d{\'e}tection d'intrusion et la remont{\'e}e d'anomalie} } @PHDTHESIS{GESBERT:2009:TEL-00481376:1, AUTHOR = {Louis Gesbert}, SCHOOL = {Université Paris-Est}, TITLE = {Développement systématique et sûreté d'exécution en programmation parallèle structurée}, YEAR = {2009}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, OPTTYPE = {}, KEYWORDS = {Parallélisme, Programmation de haut niveau, Programmation fonctionnelle, Sémantique, Sûreté des langages, Preuves de programmes, Typage, BSP}, URL = {http://tel.archives-ouvertes.fr/tel-00481376/en/}, PDF = {http://tel.archives-ouvertes.fr/tel-00481376/PDF/2009PEST0004_0_1.pdf}, ABSTRACT = {{E}xprimer le parall{\'e}lisme dans la programmation de mani{\`e}re simple et performante est un d{\'e}fi auquel l'informatique fait face, en raison de l'{\'e}volution actuelle des architectures mat{\'e}rielles. {BSML} est un langage permettant une programmation parall{\`e}le de haut niveau, structur{\'e}e, qui participe {\`a} cette recherche. {E}n s'appuyant sur le coeur du langage existant, cette th{\`e}se propose d'une part des extensions qui en font un langage plus g{\'e}n{\'e}ral et plus simple (traits imp{\'e}ratifs tels que r{\'e}f{\'e}rences et exceptions, syntaxe sp{\'e}cifique...) tout en conservant et {\'e}tendant sa s{\^u}ret{\'e} (s{\'e}mantiques formelles, syst{\`e}me de types...) et d'autre part une m{\'e}thodologie de d{\'e}veloppement d'applications parall{\`e}les certifi{\'e}es} } @PHDTHESIS{pommereauhdr, AUTHOR = {Franck Pommereau}, SCHOOL = {University of Paris-East}, TITLE = {Algebras of coloured Petri nets and their applications to modelling and verification}, YEAR = {2009}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, OPTTYPE = {}, PDF = {http://docs.google.com/fileview?id=0B-MgF6gjUGgrNDYwYTc4ZmUtZDVjNi00Mjg5LWExY2UtZTVjMzE0NmNmZTE4&hl=en} } @INCOLLECTION{IGMA_CerDenFor08, AUTHOR = {Julien Cervelle and Alberto Dennunzio and Enrico Formenti}, BOOKTITLE = {Encyclopedia of Complexity and System Science}, PUBLISHER = {Springer-Verlag}, TITLE = {Chaotic behavior of cellular automata}, YEAR = {2009}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {Robert A. Meyers}, OPTMONTH = {}, NOTE = {To appear}, OPTNUMBER = {}, OPTPAGES = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @INCOLLECTION{IGMA_CerFor08, AUTHOR = {Julien Cervelle and Enrico Formenti}, BOOKTITLE = {Encyclopedia of Complexity and System Science}, PUBLISHER = {Springer-Verlag}, TITLE = {Algorithmic Complexity and Cellular Automata}, YEAR = {2009}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {Robert A. Meyers}, OPTMONTH = {}, NOTE = {To appear}, OPTNUMBER = {}, OPTPAGES = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @INCOLLECTION{PrvLoopValarcher2009, AUTHOR = {D. Michel and P. Valarcher}, BOOKTITLE = {Studies in Weak Arithmetic}, PUBLISHER = {Stanford}, TITLE = {A total functional programming language that computes APRA}, YEAR = {2009}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTPAGES = {}, SERIES = {CSLI Lecture Notes}, OPTTYPE = {}, VOLUME = {196} } @ARTICLE{DBLP:journals/fuin/AlhazovOFV09, AUTHOR = {Artiom Alhazov and Marion Oswald and Rudolf Freund and Sergey Verlan}, JOURNAL = {Fundam. Inform.}, TITLE = {Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions}, YEAR = {2009}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {17-34}, VOLUME = {91}, DOI = {10.3233/FI-2009-0031} } @ARTICLE{DBLP:journals/join/Ben-OthmanMB09, AUTHOR = {Jalel Ben-Othman and Lynda Mokdad and Souheila Bouam}, JOURNAL = {Journal of Interconnection Networks}, TITLE = {Amclm: Adaptive Multi-Services Cross-Layer MAC Protocol for IEEE 802.11 Networks}, YEAR = {2009}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {283--301}, VOLUME = {10}, DOI = {10.1142/S0219265909002583} } @ARTICLE{DBLP:journals/corr/abs-0903-3126, AUTHOR = {Ahmed Bouajjani and Cezara Druagoi and Constantin Enea and Yan Jurski and Mihaela Sighireanu}, JOURNAL = {CoRR}, TITLE = {A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes}, YEAR = {2009}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTPAGES = {}, VOLUME = {abs/0903.3126}, URL = {http://arxiv.org/abs/0903.3126} } @ARTICLE{BesCegielski09, AUTHOR = {Alexis Bès and Patrick Cégielski}, JOURNAL = {Journal of Mathematical Sciences}, TITLE = {Nonmaximal Decidable Structures}, YEAR = {2009}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {615-622}, VOLUME = {158} } @ARTICLE{Crolard09, AUTHOR = {T. Crolard and E. Polonowski and P. Valarcher}, JOURNAL = {Special issue of ACM TOCL on Implicit Computational Complexity}, TITLE = {Extending the Loop Language with Higher-Order Procedural Variables}, YEAR = {2009}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {1-36}, VOLUME = {10} } @ARTICLE{Cegielski:2009:JMS2, AUTHOR = {Patrick Cégielski and Irène Guessarian}, JOURNAL = {Journal of Mathematical Sciences}, TITLE = {Tree inclusions in windows and slices}, YEAR = {2009}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {623-632}, VOLUME = {158} } @ARTICLE{DBLP:journals/sosym/GervaisFL09, AUTHOR = {Frédéric Gervais and Marc Frappier and Régine Laleau}, JOURNAL = {Software and System Modeling}, TITLE = {Generating relational database transactions from EB3 attribute definitions}, YEAR = {2009}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {423-445}, VOLUME = {8}, PUBLISHER = {Springer-Verlag} } @ARTICLE{GGLD2008:FGCS, AUTHOR = {Louis Gesbert and Frédéric Gava and Frédéric Loulergue and Frédéric Dabrowski}, JOURNAL = {Future Generation Computer Systems}, TITLE = {Bulk Synchronous Parallel ML with Exceptions}, YEAR = {2009}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {486--490}, VOLUME = {26}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gesbert_gava_loulergue_dabrowski_fgcs_2008.pdf}, DOI = {10.1016/j.future.2009.05.021} } @ARTICLE{haddad09:_bornes_web, AUTHOR = {S. Haddad and L. Mokdad and S. Youcef}, JOURNAL = {Journal européen des systèmes automatisés (JESA)}, TITLE = {Bornes du temps de réponse des services Web composites}, YEAR = {2009}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {7-9}, PAGES = {969--983}, VOLUME = {43} } @ARTICLE{GBN09, AUTHOR = {Gabriela Bordalo Hauser and Nathalie Caspard and Bernard Monjardet}, JOURNAL = {Czechoslovak Mathematical Journal}, TITLE = {Going down in (semi)lattices of finite Moore families and convex geometries}, YEAR = {2009}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {249--271}, VOLUME = {59}, URL = {http://halshs.archives-ouvertes.fr/halshs-00308785/fr/} } @ARTICLE{Acta2008, AUTHOR = {Hanna Klaudel and Franck Pommereau}, JOURNAL = {Acta Informatica}, TITLE = {M-nets: a survey}, YEAR = {2009}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {7-8}, PAGES = {537-564}, VOLUME = {45}, KEYWORDS = {High-level Petri nets, compositions, action refinement, synchronisation}, PUBLISHER = {Springer}, ABSTRACT = {This paper surveys the research related to the model of M-nets since it was introduced in 1995. M-nets are high-level labelled Petri nets which can be composed, like process algebra terms, using various operators. We present the core model, several of its extensions and the main applications.} } @ARTICLE{naco09, AUTHOR = {Olivier Michel and Antoine Spicher and Jean-Louis Giavitto}, JOURNAL = {Natural Computing}, TITLE = {Rule-based programming for integrative biological modeling -- Application to the modeling of the lambda phage genetic switch}, YEAR = {2009}, OPTMONTH = {}, NOTE = {Published online: 12 November 2008}, OPTNUMBER = {}, PAGES = {25}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2009/naco09.pdf}, ABSTRACT = {Systems biology aims at integrating processes at various time and spatial scales into a single and coherent formal description to allow computer modeling. In this context, we focus on rule-based modeling and its integration in the domain-specific language MGS. Through the notions of topological collections and transformations, MGS allows the modeling of biological processes at various levels of description. We validate our approach through the description of various models of the genetic switch of the lambda phage, from a very simple biochemical description of the process to an individual-based model on a Delaunay graph topology. This approach is a first step into providing the requirements for the emerging field of spatial systems biology which integrates spatial properties into systems biology.}, DOI = {10.1007/s11047-008-9105-9} } @ARTICLE{DBLP:journals/join/MokdadB09, AUTHOR = {Lynda Mokdad and Jalel Ben-Othman}, JOURNAL = {Journal of Interconnection Networks}, TITLE = {Stochastic Automata Networks for Modelling Scheduling Scheme in WiMAX Networks}, YEAR = {2009}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {481--495}, VOLUME = {10}, DOI = {10.1142/S0219265909002674} } @INPROCEEDINGS{aaai-sss09, AUTHOR = {M. Alrammal and G. Hains and M. Zergaoui}, BOOKTITLE = {Stanford Spring Symposium (SSS'09) of the AAAI: Event Processin g Stream}, TITLE = {Intelligent Ordered XPath for Processing Data Streams}, YEAR = {2009}, ADDRESS = {Stanford (CA), USA}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {March}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {AAAI}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{AlrammalHainsZergaoui2009:ICOMP, AUTHOR = {M. Alrammal and G. Hains and M. Zergaoui}, BOOKTITLE = {Proceedings of the 2009 International Conference on Internet Computing(ICOMP'09)}, TITLE = {Performance Measurements towards the Optimization of Stream Processing for XML Data}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Hamid R. Arabnia and Victor A. Clincy}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {227--233}, PUBLISHER = {CSREA Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{beauquier09:_secur_polic_enfor_using_finit_edit_autom, AUTHOR = {Danièle Beauquier and Joëlle Cohen and Ruggero Lanotte}, BOOKTITLE = {Second Workshop From Biology to Concurrency and Back (FBTC)}, TITLE = {Security Policies Enforcement Using Finite Edit Automata}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, OPTORGANIZATION = {}, PAGES = {19--35}, PUBLISHER = {Elsevier}, SERIES = {Electr. Notes Theor. Comput. Sci.}, VOLUME = {229}, DOI = {/10.1016/j.entcs.2009.06.037} } @INPROCEEDINGS{DBLP:conf/icc/BejaouiM09, AUTHOR = {Tarek Bejaoui and Lynda Mokdad}, BOOKTITLE = {IEEE International Conference on Communications (ICC)}, TITLE = {Adaptive Hybrid Call Admission Control Policy for UMTS with Underlying Tunnel-WLANs Heterogeneous Networks}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1--5}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/ICC.2009.5198701} } @INPROCEEDINGS{DBLP:conf/iscc/Ben-OthmanMCS09, AUTHOR = {Jalel Ben-Othman and Lynda Mokdad and Mohamed Ould Cheikh and Mbaye Sene}, BOOKTITLE = {14th IEEE Symposium on Computers and Communications (ISCC)}, TITLE = {Performance analysis of composite web services using Stochastic Automata Networks over IP network}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {92--97}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/ISCC.2009.5202384} } @INPROCEEDINGS{DBLP:conf/lcn/BoukercheMS09, AUTHOR = {Azzedine Boukerche and Lynda Mokdad and Samer Samarah}, BOOKTITLE = {34th Annual IEEE Conference on Local Computer Networks (LCN)}, TITLE = {The 5th IEEE International Workshop on Performance and Management of Wireless and Mobile Networks (P2MNet 2009)}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {714}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/LCN.2009.5355147} } @INPROCEEDINGS{BDMR:09:Concur, AUTHOR = {Patricia Bouyer and Marie Duflot and Nicolas Markey and Gabriel Renault}, BOOKTITLE = {20th International Conference on Concurrency Theory (CONCUR 09)}, TITLE = {Measuring Permissivity in Finite Games}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {196--210}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5710} } @INPROCEEDINGS{DBLP:conf/epew/Castel-TalebP09, AUTHOR = {Hind Castel-Taleb and Nihal Pekergin}, BOOKTITLE = {6th European Performance Engineering Workshop (EPEW) part of the Computer Performance Engineering Conference}, TITLE = {Stochastic Monotonicity in Queueing Networks}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Jeremy T. Bradley}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {116--130}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5652}, DOI = {10.1007/978-3-642-02924-0_10} } @INPROCEEDINGS{DBLP:conf/asmta/Castel-TalebP09, AUTHOR = {Hind Castel-Taleb and Nihal Pekergin}, BOOKTITLE = {16th International Conference on Analytical and Stochastic Modeling Techniques and Applications (ASMTA)}, TITLE = {Weak Stochastic Comparisons for Performability Verification}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Khalid Al-Begain and Dieter Fiems and Gábor Horváth}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {294--308}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {5513}, DOI = {10.1007/978-3-642-02205-0_21} } @INPROCEEDINGS{IGMA_CerForLoy09, AUTHOR = {Julien Cervelle and Rémi Forax and Gautier Loyauté and Gilles Roussel}, BOOKTITLE = {24th Annual ACM Symposium on Applied Computing, (SAC'09)}, TITLE = {Banzai: A Java Framework for the Implementation of High-Performance Servers}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {To appear}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, SERIES = {ACM}, OPTVOLUME = {} } @INPROCEEDINGS{cegielski09:_normal_exten_abstr_state_machin, AUTHOR = {Patrick Cégielski and Irène Guessarian}, BOOKTITLE = {Computer Science and Information Technologies (CSIT)}, TITLE = {Normalization of Extended Abstract State Machines}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {23--26}, PUBLISHER = {The National Academy of Sciences of Armenia Publishers}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{dima-time, AUTHOR = {C. Dima}, BOOKTITLE = {Proceedings of TIME'09}, TITLE = {Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {29--36}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{dima-lanotte09formats, AUTHOR = {C. Dima and R. Lanotte}, BOOKTITLE = {Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'09)}, TITLE = {Removing All Silent Transitions from Timed Automata}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {118-132}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5813} } @INPROCEEDINGS{DBLP:conf/iscc/DjouamaAMT09, AUTHOR = {Amir Djouama and Marwen Abdennebi and Lynda Mokdad and Samir Tohmé}, BOOKTITLE = {14th IEEE Symposium on Computers and Communications (ISCC)}, TITLE = {Lifetime aware admission control for infrastructure-less wireless networks}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {67--72}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/ISCC.2009.5202354} } @INPROCEEDINGS{DBLP:conf/lcn/DjouamaMAT09, AUTHOR = {Amir Djouama and Lynda Mokdad and Marwen Abdennebi and Samir Tohmé}, BOOKTITLE = {34th Annual IEEE Conference on Local Computer Networks (LCN)}, TITLE = {Topology control for enhanced QoS on infrastructure-less heterogeneous radio networks}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {414--419}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/LCN.2009.5355155} } @INPROCEEDINGS{DBLP:conf/dsrt/FourneauKP09, AUTHOR = {Jean-Michel Fourneau and Imène Kadi and Nihal Pekergin}, BOOKTITLE = {13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)}, TITLE = {Improving Time Parallel Simulation for Monotone Systems}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Stephen John Turner and David Roberts and Wentong Cai and Abdulmotaleb El-Saddik}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {231-234}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/DS-RT.2009.16} } @INPROCEEDINGS{DBLP:conf/iscc/FourneauMP09, AUTHOR = {Jean-Michel Fourneau and Lynda Mokdad and Nihal Pekergin}, BOOKTITLE = {14th IEEE Symposium on Computers and Communications (ISCC)}, TITLE = {Stochastic bounds for performance evaluation of web services}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {7--12}, PUBLISHER = {IEEE communication society}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/ISCC.2009.5202396} } @INPROCEEDINGS{FKV09, AUTHOR = {Rudolf Freund and Marian Kogler and Sergey Verlan}, BOOKTITLE = {Workshop on Non-Classical Models of Automata and Applications (NCMA)}, TITLE = {P Automata with Controlled Use of Minimal Communication Rules}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {107--120}, PUBLISHER = {Oesterreichische Computer Gesellschaft}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{GF2009:PDP, AUTHOR = {Frédéric Gava and Jean Fortin}, BOOKTITLE = {PDP 2009}, TITLE = {Two Formal Semantics of a Subset of the Paderborn University BSPlib}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {D. El Baz and F. Spies and T. Gross}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {P3544}, OPTORGANIZATION = {}, PAGES = {44--51}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_fortin_pdp_2009.pdf} } @INPROCEEDINGS{GI2009:APDCM, AUTHOR = {Frédéric Gava and Ilias Garnier}, BOOKTITLE = {Workshop APDCM, part of IPDPS'2009}, TITLE = {New Implementation of a BSP Composition Primitive with Application to the Implementation of Algorithmic Skeletons}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/qest/HaddadP09, AUTHOR = {Serge Haddad and Nihal Pekergin}, BOOKTITLE = {Sixth International Conference on the Quantitative Evaluation of Systems (QEST)}, TITLE = {Using Stochastic Comparison for Efficient Model Checking of Uncertain Markov Chains}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {177-186}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/QEST.2009.42} } @INPROCEEDINGS{DBLP:conf/globecom/HamiehBM09, AUTHOR = {Ali Hamieh and Jalel Ben-Othman and Lynda Mokdad}, BOOKTITLE = {Global Communications Conference (GLOBECOM)}, TITLE = {Detection of Radio Interference Attacks in VANET}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {5077-5083}, PUBLISHER = {IEEE communication society}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/GLOCOM.2009.5425381} } @INPROCEEDINGS{DBLP:conf/asmta/KadiPV09, AUTHOR = {Imène Kadi and Nihal Pekergin and Jean-Marc Vincent}, BOOKTITLE = {16th International Conference on Analytical and Stochastic Modeling Techniques and Applications (ASMTA)}, TITLE = {Different Monotonicity Definitions in Stochastic Modelling}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Khalid Al-Begain and Dieter Fiems and Gábor Horváth}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {144--158}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {5513}, DOI = {10.1007/978-3-642-02205-0_11} } @INPROCEEDINGS{DBLP:conf/iscc/KasseMS09, AUTHOR = {Youssou Kasse and Lynda Mokdad and Mbaye Sene}, BOOKTITLE = {14th IEEE Symposium on Computers and Communications (ISCC)}, TITLE = {Performance analysis of Web services architecture}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {94--98}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/ISCC.2009.5202414} } @INPROCEEDINGS{DBLP:conf/iscis/KlaudelKPP09, AUTHOR = {Hanna Klaudel and Maciej Koutny and Elisabeth Pelz and Franck Pommereau}, BOOKTITLE = {The 24th International Symposium on Computer and Information Sciences (ISCIS)}, TITLE = {An approach to state space reduction for systems with dynamic process creation}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {543--548}, PUBLISHER = {IEEE digital library}, OPTSERIES = {}, OPTVOLUME = {}, KEYWORDS = {multi-threaded systems, state equivalence, state space computation, state space reduction}, ABSTRACT = {Automated verification of dynamic multi-threaded computing systems can be adversely affected by problems relating to dynamic process creation. We therefore investigate --- in a general setting of labelled transition systems -- a way of reducing the state spaces of multi-threaded systems. At the heart of our method is a state equivalence, which may produce a finite representation of an infinite state system while still allowing to validate the relevant behavioural properties. We demonstrate the feasibility of the method through experiments involving the checking of the proposed state equivalence.}, DOI = {10.1109/ISCIS.2009.5291864} } @INPROCEEDINGS{inforsid/Laleau09, AUTHOR = {Pierre Konopacki and Marc Frappier and Régine Laleau}, BOOKTITLE = {Actes du XXVIIème Congrès INFORSID}, TITLE = {Modélisation de politiques de sécurité à l'aide d'une alégèbre de processus}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{KRV08c, AUTHOR = {Alexander Krassovitskiy and Yurii Rogozhin and Sergey Verlan}, BOOKTITLE = {Proceedings International Workshop on The Complexity of Simple Programs}, TITLE = {Computational Power of P Systems with Small Size Insertion and Deletion Rules}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {108--117}, OPTPUBLISHER = {}, SERIES = {EPTCS}, VOLUME = {1} } @INPROCEEDINGS{fortinSAGEO2009, AUTHOR = {X. Marsault and M. Aubry and L. Azizi and J. Fortin}, BOOKTITLE = {SAGEO}, TITLE = {Classification markovienne automatique d'images aériennes de hautes réssolutions}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{MaGeLa:2009:AFADL, AUTHOR = {A. Matoussi and Frédéric Gervais and Régine Laleau}, BOOKTITLE = {Atelier Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL 2009)}, TITLE = {De KAOS vers Event-B: approche dirigée par les buts}, YEAR = {2009}, ADDRESS = {Toulouse, France}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {26-28 January}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {71-86}, PUBLISHER = {Actes AFADL}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{matoussi09:_expres_kaos_goal_refin_patter, AUTHOR = {Abderrahman Matoussi and Frederic Gervais and Regine Laleau}, BOOKTITLE = {Rodin User and Developer Workshop 2009 - Extended Abstracts}, TITLE = {Expressing KAOS Goal Refinement Patterns with Event-B}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Michael Butler and Stefan Hallerstede and Laurent Voisin}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Technical Report, DEPLOY Project, Electronics and Computer Science, University of Southampton}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://deploy-eprints.ecs.soton.ac.uk/137/} } @INPROCEEDINGS{MFF09, AUTHOR = {J. Milhau and B. Fraikin and M. Frappier}, BOOKTITLE = {7th International Conference of Integrated Formal Methods (IFM)}, TITLE = {Automatic Generation of Error Messages for the Symbolic Execution of EB3 Process Expressions}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {337--351}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {5423} } @INPROCEEDINGS{PEKERGIN:2009:HAL-00380667:1, AUTHOR = {Nihal Pekergin and Sana Younes}, BOOKTITLE = {Proceedings of the 12th European Workshop on Dependable Computing, EWDC 2009 12th European Workshop on Dependable Computing, EWDC 2009}, TITLE = {Model Checking by Censoring Markov Chains and Stochastic Comparison}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Hélène WAESELYNCK}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {7}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00380667/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/38/06/67/PDF/FormalAnalysis_2.pdf}, ABSTRACT = {{W}e study how to combine the censoring technique for {M}arkov chains and the strong stochastic comparison to perform model checking of discrete-time {M}arkov chains. {O}ur goal is to reduce the complexity of the model checking in order to be able to consider numerically intractable models. {I}n model checking we do not need the exact values but we must decide if the required guarantees are satisfied or not. {T}hus bounding methods are suitable in this context : if the bounds meet the threshold we can decide for the satisfaction of the formula. {I}n the case when it is not possible to decide the satisfaction of the underlying formula through the bounds, we can refine the bounds by considering a larger set of states.} } @INPROCEEDINGS{MOCA09, AUTHOR = {Franck Pommereau}, BOOKTITLE = {MOCA}, TITLE = {Nets in nets with SNAKES}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Michael Duvigneau and Daniel Moldt}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1-20}, PUBLISHER = {Universität Hamburg, Dept. Informatik}, OPTSERIES = {}, OPTVOLUME = {}, KEYWORDS = {Nets within nets, modelling, tool, simulation}, PDF = {http://docs.google.com/fileview?id=0B-MgF6gjUGgrZDUzNDJjYWEtNTIwOC00NTlkLWFmZGUtOGU2YzUwMjUwYjdm&hl=en}, ABSTRACT = {This paper presents the toolkit SNAKES, focusing on the ability to model Petri nets whose tokens are Petri nets (so called nets in nets). SNAKES is a general Petri net library that allows to model and execute Python-coloured Petri nets: tokens are Python objects and net inscriptions are Python expressions. Since SNAKES itself is programmed in Python, Petri net inscriptions can handle Petri net objects as data values, for instance as tokens.} } @INPROCEEDINGS{rabih09:_statis_model_check_using_perfec_simul, AUTHOR = {Diana El Rabih and Nihal Pekergin}, BOOKTITLE = {7th International Symposium on Automated Technology for Verification and Analysis (ATVA)}, TITLE = {Statistical Model Checking using Perfect Simulation}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Zhiming Liu and Anders P. Ravn}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {120--134}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {5799}, URL = {http://www.springerlink.com/content/1753350g44525803/}, DOI = {10.1007/978-3-642-04761-9_11} } @INPROCEEDINGS{rabih09:_statis_model_check_for_stead, AUTHOR = {Diana El Rabih and Nihal Pekergin}, BOOKTITLE = {2nd International Conference on Dependability (DEPEND 09), part of NETWARE09}, TITLE = {Statistical model checking for steady state dependability verification}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {166--169}, PUBLISHER = {IEEE CS}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://www.computer.org/portal/web/csdl/proceedings/d#5}, DOI = {10.1109/DEPEND.2009.32} } @INPROCEEDINGS{s.09:_bornes_web, AUTHOR = {S. Haddad, L. Mokdad et S. Youcef}, BOOKTITLE = {7ème colloque sur la modélisation des systémes réactifs (MSR)}, TITLE = {Bornes du temps de réponse des services Web composites}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/vamos/SemmakGL09, AUTHOR = {Farida Semmak and Christophe Gnaho and Régine Laleau}, BOOKTITLE = {Third International Workshop on Variability Modelling of Software-Intensive Systems, Seville, Spain, January 28-30, 2009. Proceedings}, TITLE = {A Tool for Modelling Variability at Goal Level}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {David Benavides and Andreas Metzger and Ulrich W. Eisenecker}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {177-180}, PUBLISHER = {Universität Duisburg-Essen}, SERIES = {ICB Research Report}, VOLUME = {29}, PDF = {http://www.vamos-workshop.net/proceedings/VaMoS_2009_Proceedings.pdf} } @INPROCEEDINGS{enase/SemmakLaleauGnaho2009, AUTHOR = {Farida Semmak and Régine Laleau and Christophe Gnaho}, BOOKTITLE = {Proceedings of the 4th International Conference on Evaluation of Novel Approaches to Software Engineering (ENASE)}, TITLE = {How to Adapt the Kaos Method to the Requirements Engineering of Cycab Vehicles}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{rcis/SemmakLaleauGnaho2009, AUTHOR = {Farida Semmak and Régine Laleau and Christophe Gnaho}, BOOKTITLE = {Proceedings of the IEEE International Conference on Research Challenges in Information Science (RCIS)}, TITLE = {Supporting Variability in Goal-based Requirements}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {André Flory and Martine Collard}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {271-280}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/lcn/SeneMD09, AUTHOR = {Mbaye Sene and Lynda Mokdad and Serigne Diagne}, BOOKTITLE = {34th Annual IEEE Conference on Local Computer Networks (LCN)}, TITLE = {Load balancing in distributed communication systems: performance evaluation with SWN models}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {716--723}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/LCN.2009.5355064} } @INPROCEEDINGS{saso09, AUTHOR = {Antoine Spicher and Olivier Michel and Jean-Louis Giavitto}, BOOKTITLE = {Third IEEE International Conference on Self-Adaptive and Self-Organizing Systems - Spatial Computing Workshop}, TITLE = {Spatial Computing as Intensional Data Parallelism}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://www.lacl.fr/~michel/PUBLIS/2009/spatial-computing09.pdf}, ABSTRACT = {In this paper, we show that various concepts and tools developed in the 90's in the field of data-parallelism provide a relevant spatial programming framework. It allows high level spatial computation specifications to be translated into efficient low-level operations on processing units. We provide some short examples to illustrate this statement.} } @INPROCEEDINGS{Verlan09, AUTHOR = {Sergey Verlan}, BOOKTITLE = {10th International Workshop of Membrane Computing (WMC)}, TITLE = {Look-Ahead Evolution for P Systems}, YEAR = {2009}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {479--485}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5957} } @TECHREPORT{TR-LACL-2009-9, AUTHOR = {Muath Alrammal and Gaétan Hains and Mohamed Zergaoui}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Performance measurements towards the optimization of stream processing for XML Data}, YEAR = {2009}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2009-9}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2009-9.pdf} } @TECHREPORT{TR-LACL-2009-4, AUTHOR = {Muath Alrammal and Gaétan Hains and Mohamed Zergaoui}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Realistic Performance Gain Measurements for XML Data Streaming with Meta Data}, YEAR = {2009}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2009-4}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2009-4.pdf} } @TECHREPORT{TR-LACL-2009-3, AUTHOR = {Tristan Crolard and Emmanuel Polonowski}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A Formally Specified Type System and Operational Semantics for Higher-Order Procedural Variables}, YEAR = {2009}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2009-3}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2009-3.pdf} } @TECHREPORT{dima-tctlk-techreport, AUTHOR = {C. Dima}, INSTITUTION = {LACL, Université Paris 12}, TITLE = {Positive and negative results on the decidability of the model-checking problem for an epistemic extension of Timed CTL}, YEAR = {2009}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2009-11}, OPTTYPE = {} } @TECHREPORT{dima-epsilon-techrep, AUTHOR = {C. Dima and R. Lanotte}, INSTITUTION = {LACL}, TITLE = {Removing all silent transitions from timed automata}, YEAR = {2009}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2009-10}, OPTTYPE = {} } @TECHREPORT{TR-LACL-2009-06, AUTHOR = {Louis Gesbert and Frederic Gava}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {New syntax of a High-level BSP language with application to parallel pattern-matching and exception handling}, YEAR = {2009}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2009-06}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2009-06.pdf} } @TECHREPORT{TR-LACL-2009-1, AUTHOR = {Gaetan Hains and Erol Ozan}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Development of a framework for the enterprise RFID Defense System Architecture}, YEAR = {2009}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2009-1}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2009-1.pdf} } @TECHREPORT{TR-LACL-2009-5, AUTHOR = {Abderrahman Matoussi and Regine Laleau and Dorian Petit}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Bridging the gap between KAOS requirements models and B specifications}, YEAR = {2009}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2009-5}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2009-5.pdf} } @TECHREPORT{TR-LACL-2009-8, AUTHOR = {Emmanuel Polonowski}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {LoopW Technical Reference v0.3}, YEAR = {2009}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2009-8}, OPTTYPE = {}, URL = {http://hal.archives-ouvertes.fr/hal-00443669/en/}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2009-8.pdf} } @TECHREPORT{TR-LACL-2009-2, AUTHOR = {Diana El Rabih and Nihal Pekergin}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Statistical Model Checking Approach for Stationary Dependability Verification}, YEAR = {2009}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2009-2}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2009-2.pdf} } @TECHREPORT{SOLIMAN:2010:INRIA-00461084:1, AUTHOR = {Sylvain Soliman and Claudine Chaouiya and Gregory Batt and Francois Fages and Elisabeth Remy and Franck Pommereau and Laurence Calzone}, INSTITUTION = {}, TITLE = {Modelling molecular networks: relationships between different formalisms and levels of details}, YEAR = {2009}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTTYPE = {}, KEYWORDS = {regulation networks, expressivity, abstraction, formalisms, modelling}, URL = {http://hal.archives-ouvertes.fr/inria-00461084/en/}, PDF = {http://hal.archives-ouvertes.fr/inria-00461084/PDF/RR-7221.pdf}, ABSTRACT = {{T}his document is the deliverable 1.3 of {F}rench {ANR} {CALAMAR}. {I}t presents a study of different formalisms used for modelling and analyzing large molecular regulation networks, their formal links, in terms of mutual encodings and of abstractions, and the corresponding levels of detail captured.} } @MASTERSTHESIS{milhauMSC, AUTHOR = {Jérémy Milhau}, SCHOOL = {Université de Sherbrooke}, TITLE = {Génération automatique de messages d'erreurs pour l'exécution symbolique d'expressions de processus EB3}, YEAR = {2009}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, OPTTYPE = {} } @UNPUBLISHED{DUMONT:2009:HAL-00378342:1, AUTHOR = {Cyril Dumont and Fabrice Mourlin}, NOTE = {}, TITLE = {Space Based Architecture for numerical solving}, OPTMONTH = {}, YEAR = {2009}, URL = {http://hal.archives-ouvertes.fr/hal-00378342/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/37/83/42/PDF/dumont-SBANumericalSolving.pdf}, ABSTRACT = {{A} strategy for the analytical solving of ordinary differential equations and a first implementation of it based on mobile agent community, using jini javaspace framework, are presented. {T}his architecture is defined to support computation in a reconfiguration context. {I}t means evolving network (blackout of processor) or internal event management (exception during computation). {A}ll the incidents are taken into account with our computing space and in the worst case; a state of the current computation is saved for a post mortem analysis or a further replay.} } @PROCEEDINGS{laleau08:_actes_congr_infor, TITLE = {Actes du 26ème Congès INFORSID}, YEAR = {2008}, ADDRESS = {Fontainebleau}, EDITOR = {R. Laleau and D. Rieu and P. Valarcher}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://inforsid.irit.fr/} } @PROCEEDINGS{vanthienen08:_caise0_works_regul_model_deploy_remod, TITLE = {CAISE'08 Workshop on Regulations Modelling and Deployment, ReMoD'08. CEUR-Workshop Proceedings 342}, YEAR = {2008}, OPTADDRESS = {}, EDITOR = {J. Vanthienen and S. Hoppenbrouwers and R. Laleau}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-342/} } @PHDTHESIS{VASSILIEV:2008:TEL-00462013:1, AUTHOR = {Pavel Vassiliev}, SCHOOL = {Université Paris-Est; Université de Saint-Pétersbourg}, TITLE = {Développement et réalisation d'un simulateur de machines à états abstraits temps-réel et model-checking de formules d'une logique des prédicats temporisée du premier ordre}, YEAR = {2008}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, OPTTYPE = {}, PDF = {http://tel.archives-ouvertes.fr/tel-00462013/PDF/2008PEST0050_0_0.pdf} } @ARTICLE{Verlan08b, AUTHOR = {Francesco Bernardini and Marian Gheorghe and Maurice Margenstern and Sergey Verlan}, JOURNAL = {Int. J. Found. Comput. Sci.}, TITLE = {How to Synchronize the Activity of All Components of a P System?}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {5}, PAGES = {1183-1198}, VOLUME = {19}, DOI = {10.1142/S0129054108006224} } @ARTICLE{Bes08, AUTHOR = {Alexis Bès}, JOURNAL = {Logical Methods in Computer Science}, TITLE = {An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1:8}, OPTPAGES = {}, VOLUME = {4} } @ARTICLE{Cegielski:2008:RAIRO2, AUTHOR = {Alexis Bès and Patrick Cégielski}, JOURNAL = {RAIRO--Theor. inf. Appl.}, TITLE = {Weakly maximal decidable structures}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {137-145}, VOLUME = {42} } @ARTICLE{Verlan08a, AUTHOR = {Erzsébet Csuhaj-Varjú and Sergey Verlan}, JOURNAL = {Natural Computing}, TITLE = {On length-separating test tube systems}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {167-181}, VOLUME = {7}, DOI = {10.1007/s11047-007-9034-z} } @ARTICLE{Cegielski:2008:RAIRO, AUTHOR = {Patrick Cégielski and Irène Guessarian and Yuri Matiyasevich}, JOURNAL = {RAIRO--Theor. inf. Appl.}, TITLE = {Tree inclusion problems}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {5-20}, VOLUME = {42} } @ARTICLE{dima-enea-abstractions, AUTHOR = {C. Enea and C. Dima}, JOURNAL = {International Transactions on Systems Science and Applications}, TITLE = {Abstractions of multi-agent systems}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {329--337}, VOLUME = {3} } @ARTICLE{FrGeLaFrSt:2008:revueISSE, AUTHOR = {Marc Frappier and Frédéric Gervais and Régine Laleau and B. Fraikin and R. St-Denis}, JOURNAL = {Innovations in Systems and Software Engineering}, TITLE = {Extending Statecharts with Process Algebra Operators}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {285-292}, VOLUME = {4}, PUBLISHER = {Springer-Verlag} } @ARTICLE{GAVA2008:PPL, AUTHOR = {Frédéric Gava}, JOURNAL = {Parallel Processing Letters}, TITLE = {A Modular Implementation of Parallel Data Structures in BSML}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {39--53}, VOLUME = {18}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_ppl_2008.pdf}, DOI = {10.1142/S0129626408003211} } @ARTICLE{ledru08:_une, AUTHOR = {Y. Ledru and R. Laleau and S. Vignes}, JOURNAL = {RSTI - Ingénierie des Sysèmes d'Information}, TITLE = {Une tentative d'utilisation conjointe d'UML et d'une méthode formelle pour la modélisation de la sécurité d'aéroports}, YEAR = {2008}, OPTMONTH = {}, NOTE = {Hermes-Lavoisier}, NUMBER = {4}, PAGES = {133--157}, VOLUME = {13} } @ARTICLE{MaLa:2007:TSI, AUTHOR = {Amel Mammar and Régine Laleau}, JOURNAL = {Technique et Science Informatiques}, TITLE = {Implémentation JAVA d'une spécification B: Application aux bases de données}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {5}, PAGES = {537--570}, VOLUME = {27} } @ARTICLE{DBLP:journals/cor/MamounFP08, AUTHOR = {Mouad Ben Mamoun and Jean-Michel Fourneau and Nihal Pekergin}, JOURNAL = {Computers and Operations Research}, TITLE = {Analyzing Weighted Round Robin policies with a stochastic comparison approach}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {8}, PAGES = {2420-2431}, VOLUME = {35}, PUBLISHER = {Elsevier}, DOI = {10.1016/j.cor.2006.12.007} } @ARTICLE{mokdad08:_stoch, AUTHOR = {L. Mokdad and H. Castel}, JOURNAL = {Journal of computer communication}, TITLE = {Stochastic comparisons: a methodology for the performance evaluation of fixed and mobile networks}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {17}, PAGES = {3894--3904}, VOLUME = {31} } @ARTICLE{EvTrLaFr:2007:SSM, AUTHOR = {Evans N. and Treharne H. and Régine Laleau and Marc Frappier}, JOURNAL = {Software and Systems Modeling}, TITLE = {Applying CSP$||$ B to Information Systems}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {85--102}, VOLUME = {7}, PUBLISHER = {Springer-Verlag} } @ARTICLE{DBLP:journals/jar/Paskevich08, AUTHOR = {Andrey Paskevich}, JOURNAL = {J. Autom. Reasoning}, TITLE = {Connection Tableaux with Lazy Paramodulation}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2-3}, PAGES = {179-194}, VOLUME = {40}, DOI = {10.1007/s10817-007-9089-7} } @ARTICLE{SliVas:2008:STASMPLMC, AUTHOR = {Anatol Slissenko and Pavel Vasilyev}, JOURNAL = {J. of Universal Computer Science}, TITLE = {Simulation of Timed Abstract State Machines with Predicate Logic Model-Checking}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {12}, PAGES = {1984--2006}, VOLUME = {14}, ABSTRACT = {We describe a prototype of a simulator for reactive timed abstract state machines (ASM) that checks whether the generated runs verify a requirements specification represented as a formula of a First Order Timed Logic (FOTL). The simulator deals with ASM with continuous or discrete time. The time constraints are linear inequalities. It can treat two semantics, one with instantaneous actions and another one with delayed actions, the delays being bounded and non-deterministic.} } @ARTICLE{spicher07bio, AUTHOR = {Antoine Spicher and Olivier Michel and Mikolaj Cieslak and Jean-Louis Giavitto and Przemyslaw Prusinkiewicz}, JOURNAL = {BioSystems}, TITLE = {Stochastic P Systems and the Simulation of Biochemical Processes with Dynamic Compartments}, YEAR = {2008}, MONTH = {March}, OPTNOTE = {}, NUMBER = {3}, PAGES = {458-472}, VOLUME = {91}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2008/biosystem08.pdf}, ABSTRACT = { We introduce a sequential rewriting strategy for P systems based on Gillespie's stochastic simulation algorithm, and apply the resulting formalism of stochastic P systems to simulate biochemical processes in dynamically changing, nested compartments. Stochastic P systems have been implemented using the spatially explicit programming language {\mgs}. Implementation examples include models of the Lotka-Volterra auto-catalytic system, and the life cycle of the Semliki Forest virus.} } @ARTICLE{DBLP:journals/jcs/TipleaBEB08, AUTHOR = {Ferucio Laurentiu Tiplea and Catalin V. Birjoveanu and Constantin Enea and Ioana Boureanu}, JOURNAL = {Journal of Computer Security}, TITLE = {Secrecy for bounded security protocols with freshness check is NEXPTIME-complete}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {6}, PAGES = {689-712}, VOLUME = {16}, DOI = {10.3233/JCS-2007-0306} } @ARTICLE{tran08:_kelly_networ_shuff, AUTHOR = {Minh-Anh Tran and Thomas Bonald}, JOURNAL = {Queueing Systems}, TITLE = {On Kelly Networks with Shuffling}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {53--61}, VOLUME = {59}, URL = {http://www.springerlink.com/content/x0412n4417p11q37/} } @ARTICLE{valarcher:rairo2008, AUTHOR = {P. Valarcher}, JOURNAL = {Theoretical Informatics and Aplications}, TITLE = {A complete characterization of primitive recursive intensional behaviours}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTPAGES = {}, VOLUME = {14} } @ARTICLE{Verlan08c, AUTHOR = {Sergey Verlan and Francesco Bernardini and Marian Gheorghe and Maurice Margenstern}, JOURNAL = {Theoretical Computer Science}, TITLE = {Generalized communicating P systems}, YEAR = {2008}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1-2}, PAGES = {170-184}, VOLUME = {404}, DOI = {10.1016/j.tcs.2008.04.008} } @INPROCEEDINGS{Verlan08d, AUTHOR = {Artiom Alhazov and Maurice Margenstern and Sergey Verlan}, BOOKTITLE = {Membrane Computing - 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers}, TITLE = {Fast Synchronization in P Systems}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {David W. Corne and Pierluigi Frisco and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {118-128}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5391}, DOI = {10.1007/978-3-540-95885-7_9} } @INPROCEEDINGS{DBLP:conf/csr/BedonBCR08, AUTHOR = {Nicolas Bedon and Alexis Bès and Olivier Carton and Chloe Rispal}, BOOKTITLE = {Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings}, TITLE = {Logic and Rational Languages of Words Indexed by Linear Orderings}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Edward A. Hirsch and Alexander A. Razborov and Alexei L. Semenov and Anatol Slissenko}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {76-85}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5010}, DOI = {10.1007/978-3-540-79709-8_11} } @INPROCEEDINGS{DBLP:conf/aiccsa/Ben-OthmanNMR08, AUTHOR = {Jalel Ben-Othman and Farid Naït-Abdesselam and Lynda Mokdad and Octavio Ramirez Rojas}, BOOKTITLE = {The 6th ACS/IEEE International Conference on Computer Systems and Applications (AICCSA 2008)}, TITLE = {Performance evaluation of TCP handoffs over mobile IP connections}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {366--372}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/AICCSA.2008.4493559} } @INPROCEEDINGS{ICATPN08, AUTHOR = {Roland Bouroulet and Raymond Devillers and Hanna Klaudel and Elisabeth Pelz and Franck Pommereau}, BOOKTITLE = {}, TITLE = {Modeling and analysis of security protocols using role based specifications and Petri nets}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {72-91}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5062}, KEYWORDS = {Security protocols, formal specification, process algebras, Petri nets}, ABSTRACT = {In this paper, we introduce a framework composed of a syntax and its compositional Petri net semantics, for the specification and verification of properties (like authentication) of security protocols. The protocol agents (e.g., an initiator, a responder, a server, a trusted third party, ...) are formalized as roles, each of them having a predefined behavior depending on their global and also local knowledge (including for instance public, private and shared keys), and may interact in a potentially hostile environment. The main characteristics of our framework, is that it makes explicit, structured and formal, the usually implicit information necessary to analyse the protocol, for instance the public and private context of execution. The roles and the environment are expressed using SPL processes and compositionally translated into high-level Petri nets, while the context specifying the global and local knowledge of the participants in the protocol is used to generate the corresponding initial marking (with respect to the studied property). Finally, this representation is used to analyse the protocol properties, applying techniques of simulation and model-checking on Petri nets. The complete approach is illustrated on the case study of the Kao-Chow authentication protocol.} } @INPROCEEDINGS{DBLP:conf/iceis/BrunetSLG08, AUTHOR = {Joël Brunet and Farida Semmak and Régine Laleau and Christophe Gnaho}, BOOKTITLE = {ICEIS (3-2)}, TITLE = {ICEIS 2008 - Proceedings of the Tenth International Conference on Enterprise Information Systems, Volume ISAS-2, Barcelona, Spain, June 12-16, 2008}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {José Cordeiro and Joaquim Filipe}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {339-344}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{PekerginMokdad:SPECTS2008, AUTHOR = {Hind Castel-taleb and Lynda Mokdad and Nihal Pekergin}, BOOKTITLE = {Symp. on Performance Evaluation of Computer and telecommunication Systems}, TITLE = {Model Checking of performance measures using bounding aggregations}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{IGMA_CerForRou08, AUTHOR = {Julien Cervelle and Rémi Forax and Gilles Roussel}, BOOKTITLE = {Compilers, Related Technologies and Applications (CoRTA'08)}, TITLE = {Tatoo: a Java efficient parser generator}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{ChamseddineDFPS08, AUTHOR = {N. Chamseddine and M. Duflot and L. Fribourg and C. Picaronny and J. Sproston}, BOOKTITLE = {ifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008)}, TITLE = {Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {254--263}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{CohSliss:2007:ISRTASMD, AUTHOR = {Joëlle Cohen and Anatol Slissenko}, BOOKTITLE = {Proc. of the 6th Intern. Conf. on Computer Science and Information Technology (CSIT'2007), September 24--28, 2007, Yerevan, Armenia. Organized by National Academy of Science of Armenia in cooperation with Test Technology Technical Council of IEEE Computer Society}, TITLE = {Implementation of Sturdy Real-Time Abstract State Machines by Machines with Delays}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {8 pages}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {National Academy of Science of Armenia}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{CohSli:2008:SRTASMD, AUTHOR = {Joëlle Cohen and Anatol Slissenko}, BOOKTITLE = {Proc. of the First Int. Conference on Abstract State Machines, B and Z (ABZ2008), September 16--18, 2008, London, UK. Lect. Notes in Comput. Sci., vol. 5238}, TITLE = {Stability of Real-Time Abstract State Machines under Desynchronization}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {E. Börger, M. Butler, J. P. Bowen, P. Boca}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {341}, PUBLISHER = {Springer-Verlag}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{dima08clima, AUTHOR = {C. Dima}, BOOKTITLE = {Proceedings of the 9th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA IX)}, TITLE = {Revisiting satisfiability and model-checking for CTLK with synchrony and perfect recall}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {117--131}, OPTPUBLISHER = {}, SERIES = {LNAI}, VOLUME = {5405} } @INPROCEEDINGS{DUMONT:2008:HAL-00378342:1, AUTHOR = {Cyril Dumont and Fabrice Mourlin}, BOOKTITLE = {International Conferences on Computational Intelligence for Modelling, Control and Automation; Intelligent Agents, Web Technologies and Internet Commerce; and Innovation in Software Engineering International Conferences on Computational Intelligence for Modelling, Control and Automation; Intelligent Agents, Web Technologies and Internet Commerce; and Innovation in Software Engineering}, TITLE = {Space Based Architecture for numerical solving}, YEAR = {2008}, ADDRESS = {Vienna Austria}, OPTCROSSREF = {}, EDITOR = { IEEE}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {309-314}, OPTPUBLISHER = {}, SERIES = {IEEE Digital Library}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00378342/en/}, PDF = {http://hal.archives-ouvertes.fr/hal-00378342/PDF/dumont-SBANumericalSolving.pdf}, ABSTRACT = {{A} strategy for the analytical solving of ordinary differential equations and a first implementation of it based on mobile agent community, using jini javaspace framework, are presented. {T}his architecture is defined to support computation in a reconfiguration context. {I}t means evolving network (blackout of processor) or internal event management (exception during computation). {A}ll the incidents are taken into account with our computing space and in the worst case; a state of the current computation is saved for a post mortem analysis or a further replay.}, DOI = {10.1109/CIMCA.2008.157} } @INPROCEEDINGS{DBLP:conf/ecbs/Enea08, AUTHOR = {Constantin Enea}, BOOKTITLE = {15th Annual IEEE International Conference and Workshop on Engineering of Computer Based Systems (ECBS 2008), 31 March - 4 April 2008, Belfast, Northern Ireland}, TITLE = {Counterexample Guided Abstraction Refinement is Better under Equational Abstraction}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {126-135}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/ECBS.2008.40} } @INPROCEEDINGS{GAVA2008:ICCS, AUTHOR = {Frédéric Gava}, BOOKTITLE = {The International Conference on Computational Science (ICCS), Part I}, TITLE = {BSP Functional Programming; Examples of a cost based methodology}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {M. Bubak and van Albada, G. D. and J. Dongarra and P. M. A. Sloot}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {375--385}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {5101}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_iccs_2008.pdf}, DOI = {10.1007/978-3-540-69384-0_43} } @INPROCEEDINGS{GF2008:PDCAT, AUTHOR = {Frédéric Gava and Jean Fortin}, BOOKTITLE = {PDCAT 2008}, TITLE = {Formal Semantics of a Subset of the Paderborn's BSPlib}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Z. Huang and Z. Xu and N. Rountree and L. Lefevre and H. Shen and Y. Pan}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {P3443}, OPTORGANIZATION = {}, PAGES = {269--276}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_fortin_pdcat_2008.pdf}, DOI = {10.1109/PDCAT.2008.43} } @INPROCEEDINGS{DBLP:conf/globecom/GhazalMB08, AUTHOR = {Sahar Ghazal and Lynda Mokdad and Jalel Ben-Othman}, BOOKTITLE = {Proceedings of the Global Communications Conference (GLOBECOM)}, TITLE = {A Real Time Adaptive Scheduling Scheme for Multi-Service Flows in WiMAX Networks}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1652--1656}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/GLOCOM.2008.ECP.321} } @INPROCEEDINGS{DBLP:conf/icc/GhazalMB08, AUTHOR = {Sahar Ghazal and Lynda Mokdad and Jalel Ben-Othman}, BOOKTITLE = {Proceedings of IEEE International Conference on Communications (ICC)}, TITLE = {Performance Analysis of UGS, rtPS, nrtPS Admission Control in WiMAX Networks}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {2696--2701}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/ICC.2008.509} } @INPROCEEDINGS{GIAVITTO:2008:HAL-00340504:1, AUTHOR = {Jean-Louis Giavitto and Olivier Michel}, BOOKTITLE = {1st European Workshop on Correlations in Computer Science 1st European Workshop on Correlations in Computer Science}, TITLE = {Topological Structure of Interactions}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00340504/en/} } @INPROCEEDINGS{GIAVITTO:2008:HAL-00340505:1, AUTHOR = {Jean-Louis Giavitto and Olivier Michel}, BOOKTITLE = {Rencontre toulousaine graphes et topologie}, TITLE = {Topologie combinatoire et programmation}, YEAR = {2008}, ADDRESS = {Toulouse France}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00340505/en/} } @INPROCEEDINGS{iterlink08, AUTHOR = {Jean-Louis Giavitto and Olivier Michel and Antoine Spicher}, BOOKTITLE = {Software-Intensive Systems}, TITLE = {Spatial Organization of the Chemical Paradigm and the Specification of Autonomic Systems}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2008/interlink08.pdf}, ABSTRACT = {The chemical paradigm is an unconventional programming paradigm well fitted to the high-level specification of parallel systems. Based on the fixed point iterations of local rules, its use has been advocated for the programming of autonomic and amorphous systems. However, this model lacks an explicit handling of spatial relationships. In this contribution, we first show how the chemical paradigm can be extended beyond multisets to arbitrary topological collections. Topological collections handle in a uniform way sophisticated data structures required in algorithmics as well as distributed data structures needed for the programming of autonomic or amorphous systems. Then we adapt a well-known result on multiset ordering to the more general case of topological collections. Well-founded ordering on topological collection can be used to prove the termination of the fixed point iteration of local rules.} } @INPROCEEDINGS{guelev-dima2008dalt, AUTHOR = {D. Guelev and C. Dima}, BOOKTITLE = {Proceedings of DALT 2008}, TITLE = {Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {75--90}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5397} } @INPROCEEDINGS{haddad08:_respon_web, AUTHOR = {S. Haddad and L. Mokdad and S. Youcef}, BOOKTITLE = {6th IEEE Symposium Communication Systems, Networks and Digital Signal Processing (CNDSPS)}, TITLE = {Response time analysis for composite Web services}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1--5}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{ICTAC08, AUTHOR = {Hanna Klaudel and Maciej Koutny and Elisabeth Pelz and Franck Pommereau}, BOOKTITLE = {}, TITLE = {Towards Efficient Verification of Systems with Dynamic Process Creation}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {186-200}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5160}, KEYWORDS = {Petri nets, multi-threaded systems, marking symmetries, state-space computation}, ABSTRACT = {Modelling and analysis of dynamic multi-threaded state systems often encounters obstacles when one wants to use automated verification methods, such as model checking. Our aim in this paper is to propose a technical device for coping with one such obstacle, namely that caused by dynamic process creation. We first introduce a general class of high-level Petri nets-not tied to any particular syntax or technology-allowing one to capture systems with dynamic (and also concurrent) process creation as well as capable of manipulating data. We then introduce the core of our method which is a marking equivalence that can be computed efficiently and may then be used, for instance, to aggregate markings in a marking graph. In some situations, such an aggregation may produce a finite representation of an infinite state systems which still allows one to establish the relevant behavioural properties. We show feasibility of the method on an example and provide initial experimental results.} } @INPROCEEDINGS{Verlan08h, AUTHOR = {Alexander Krassovitskiy and Yurii Rogozhin and Sergey Verlan}, BOOKTITLE = {Complexity of Simple Programs 2008, CSP 2008, Cork, Ireland, December 6-7, 2008. Proceedings}, TITLE = {Computational Power of P Systems with Small Size Insertion and Deletion Rules}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Turlough Neary and Damien Woods and Anthony Karel Seda and Niall Murphy}, OPTMONTH = {}, NOTE = {Invited Paper}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {137-148}, PUBLISHER = {Cork University Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Verlan08e, AUTHOR = {Alexander Krassovitskiy and Yurii Rogozhin and Sergey Verlan}, BOOKTITLE = {Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers}, TITLE = {Further Results on Insertion-Deletion Systems with One-Sided Contexts}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Carlos Martìn-Vide and Friedrich Otto and Henning Fernau}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {333-344}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5196}, DOI = {10.1007/978-3-540-88282-4_31} } @INPROCEEDINGS{DBLP:conf/asmta/MamounP08, AUTHOR = {Mouad Ben Mamoun and Nihal Pekergin}, BOOKTITLE = {15th International Conference Analytical and Stochastic Modeling Techniques and Applications (ASMTA)}, TITLE = {Model Checking of Infinite State Space Markov Chains by Stochastic Bounds}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Khalid Al-Begain and Armin Heindl and Miklós Telek}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {264-278}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5055}, DOI = {10.1007/978-3-540-68982-9_19} } @INPROCEEDINGS{matoussi08:_first_attem_to_expres_kaos, AUTHOR = {Abderrahman Matoussi and Frederic Gervais and Regine Laleau}, BOOKTITLE = {Int. Conf. on ASM, B and Z (ABZ)}, TITLE = {A First Attempt to Express KAOS Refinement Patterns with Event B}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {E. Borger and J. Bowen and M. Butler}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {338}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {5238}, URL = {http://www.springerlink.com/content/u5448j5035563017/} } @INPROCEEDINGS{DBLP:conf/lcn/MokdadB08, AUTHOR = {Lynda Mokdad and Jalel Ben-Othman}, BOOKTITLE = {The 33rd IEEE Conference on Local Computer Networks, The Conference on Leading Edge and Practical Computer Networking (LCN)}, TITLE = {Performance analysis of an admission control enhancement in WIMAX networks using SAN}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {674--679}, PUBLISHER = {IEEE}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/LCN.2008.4664264} } @INPROCEEDINGS{Norris2008, AUTHOR = {Vic Norris and Abdallah Zemirline and Patrick Amar and Pascal Ballet and Eshel Ben Jacob and Gilles Bernot and Guillaume Beslon and Eric Fanchon and Jean-Louis Giavitto and Nicolas Glade and Patrick Greussay and Yohann Grondin and James A. Foster and Guillaume Hutzler and and Francois Kepes and Olivier Michel and Gradimir Misevic and Franck Molina and Jacqueline Signorini and Pasquale Stano and Alain Thierry}, BOOKTITLE = {Lille Spring School on Modelling Complex Biological Systems in the Context of Genomics}, TITLE = {From bioputing to bactoputing : computing with bacteria}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {April}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {123--150}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{PNTAP08, AUTHOR = {Franck Pommereau}, BOOKTITLE = {}, TITLE = {Quickly prototyping Petri nets tools with SNAKES}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {y}, OPTORGANIZATION = {}, PAGES = {1-10}, PUBLISHER = {ACM}, SERIES = {ACM Digital Library}, VOLUME = {xx}, KEYWORDS = {Petri nets, quick prototyping}, ABSTRACT = {This paper presents the toolkit SNAKES that is aimed at providing a flexible solution to the problem of quickly prototyping Petri nets tools. In particular, SNAKES is expected to have as few built-in limitations as possible with respect to the particular variant of Petri net to be used. The goal is to make SNAKES suitable for any kind of Petri net model, including new ones for which there exists no available tool. For this purpose, SNAKES is designed as a very general Petri net core library enriched with a set of extension modules to provide specialised features. On the one hand, the core library is versatile in that it defines a general Petri net structure where all the computational aspects are delegated to an interpreted programming language. On the other hand, the extension modules provide with enough flexibility to allow to redefine easily any part of the base Petri net model. SNAKES is released under the GNU LGPL, it can be downloaded at http://lacl.univ-paris12.fr/pommereau/soft/snakes[] with the API documentation and a tutorial.} } @INPROCEEDINGS{rabih08:_model_check_of_csl_stead, AUTHOR = {Diana El Rabih}, BOOKTITLE = {9ie¨me Atelier en Evaluation de Performances}, TITLE = {Model Checking of CSL Steady-State Operator with Perfect Simulation}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://aep9.imag.fr/papers/ElRabihPekergin_aep9.pdf} } @INPROCEEDINGS{DBLP:conf/caise/SemmakGL08, AUTHOR = {Farida Semmak and Christophe Gnaho and Régine Laleau}, BOOKTITLE = {Proceedings of the International Workshop on Model Driven Information Systems Engineering: Enterprise, User and System Models (MoDISE-EUS'08) held in conjunction with the CAiSE'08 Conference, Montpellier, France, June 16-17, 2008}, TITLE = {Extended Kaos to Support Variability for Goal Oriented Requirements Reuse}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Sophie Ebersold and Agnès Front and Philippe Lopistéguy and Selmin Nurcan and Xavier Franch and Ela Hunt and Remi Coletta}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {22-33}, PUBLISHER = {CEUR-WS.org CEUR-WS.org}, SERIES = {CEUR Workshop Proceedings}, VOLUME = {341}, PDF = {http://ceur-ws.org/Vol-341/paper3.pdf} } @INPROCEEDINGS{Verlan08g, AUTHOR = {Sergey Verlan and Yurii Rogozhin}, BOOKTITLE = {Complexity of Simple Programs 2008, CSP 2008, Cork, Ireland, December 6-7, 2008. Proceedings}, TITLE = {New Choice for Small Universal Devices: Symport/Antiport P Systems}, YEAR = {2008}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Turlough Neary and Damien Woods and Anthony Karel Seda and Niall Murphy}, OPTMONTH = {}, NOTE = {Invited Paper}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {305-314}, PUBLISHER = {Cork University Press}, OPTSERIES = {}, OPTVOLUME = {} } @TECHREPORT{Verlan08i, AUTHOR = {Artiom Alhazov and Ion Petre and Sergey Verlan}, INSTITUTION = {TUCS Repport No. 902}, TITLE = {A Sequence-Based Analysis of the Pointer Distribution of Ciliate Genes}, YEAR = {2008}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {902}, OPTTYPE = {}, URL = {http://www.tucs.fi/publications/insight.php?id=tAlPeVe08a} } @TECHREPORT{Verlan08f, AUTHOR = {Artiom Alhazov and Sergey Verlan}, INSTITUTION = {TUCS Repport No. 862}, TITLE = {Minimization Strategies for Maximally Parallel Multiset Rewriting Systems}, YEAR = {2008}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {862}, OPTTYPE = {}, URL = {http://www.tucs.fi/publications/insight.php?id=tAlVe08a} } @TECHREPORT{TR-LACL-2008-4, AUTHOR = {Muath Alrammal and Gaétan Hains and Mohamed Zergaoui}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Intelligent Ordered XPath for Processing Data Streams}, YEAR = {2008}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2008-4}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2008-4.pdf} } @TECHREPORT{TR-LACL-2008-2, AUTHOR = {Joëlle Cohen and Anatol Slissenko}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Implementation of Timed Abstract State Machines with Instantaneous Actions by Machines with Delays}, YEAR = {2008}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2008-2}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2008-2.pdf} } @TECHREPORT{TR-LACL-2008-3, AUTHOR = {Tristan Crolard and Emmanuel Polonowski and Pierre Valarcher}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Extending the Loop Language with Higher-Order Procedural Variables}, YEAR = {2008}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2008-3}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2008-3.pdf} } @TECHREPORT{TR-LACL-2008-6, AUTHOR = {Jean Fortin and Frédéric Gava}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Formal Operational Semantics of a Core Imperative BSP language ; Application to the proof of a numerical program and a certified optimization}, YEAR = {2008}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2008-6}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2008-6.pdf} } @TECHREPORT{TR-LACL-2008-5, AUTHOR = {Ilias Garnier and Frédéric Gava}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {New Implementation of a Parallel Composition Primitive for a Functionnal BSP Language}, YEAR = {2008}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2008-5}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2008-5.pdf} } @TECHREPORT{TR-LACL-2008-1, AUTHOR = {Hanna Klaudel and Maciej Koutny and Elisabeth Pelz and Franck Pommereau}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Towards Efficient Verification of Systems with Dynamic Process Creation}, YEAR = {2008}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTTYPE = {}, KEYWORDS = {Petri nets, multi-threaded systems, marking symmetries, state-space generation}, PAGES = {1-20}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2008-1.pdf}, ABSTRACT = {Modelling and analysis of dynamic multi-threaded state systems often encounters obstacles when one wants to use automated verification methods, such as model checking. Our aim in this paper is to develop a technical device for coping with one such obstacle, namely that caused by dynamic process creation. We first introduce a general class of coloured Petri nets-not tied to any particular syntax or approach-allowing one to capture systems with dynamic (and concurrent) process creation as well as capable of manipulating data. Following this, we introduce the central notion of our method which is a marking equivalence that can be efficiently computed and then used, for instance, to aggregate markings in a reachability graph. In some situations, such an aggregation may produce a finite representation of an infinite state system which still allows one to establish the relevant behavioural properties. We show feasibility of the method on an example and provide initial experimental results.} } @TECHREPORT{TR-LACL-2008-7, AUTHOR = {Régine Laleau and Abderrahman Matoussi}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A Survey of Non-Functional Requirements in Software Development Process}, YEAR = {2008}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2008-7}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2008-7.pdf} } @TECHREPORT{matoussi08:_first_attem_to_expres_kaos, AUTHOR = {Abderrahman Matoussi and an Regine Laleau, Frederic Gervais}, INSTITUTION = {Electronics and Computer Science, University of Southampton}, TITLE = {A First Attempt to Express KAOS Refinement Patterns with Event B}, YEAR = {2008}, OPTADDRESS = {}, OPTMONTH = {}, NOTE = {ABZ2008 Conference - Short Papers. In E. Boerger, M. Butler, J. Bowen and P. Boca. pages 12-14}, OPTNUMBER = {}, OPTTYPE = {}, URL = {http://eprints.ecs.soton.ac.uk/16640/} } @UNPUBLISHED{BORDALO:2008:HALSHS-00308785:1, AUTHOR = {Gabriela Bordalo and Nathalie Caspard and Bernard Monjardet}, NOTE = {Version préliminaire. Version finale à paraître dans Czechoslovak Mathematical Journal.}, TITLE = {Going down in (semi)lattices of finite Moore families and convex geometries}, OPTMONTH = {}, YEAR = {2008}, KEYWORDS = {closure system, convex geometry, cover relation, join-irreducible, Moore family, poset of irreducible, semilattice}, URL = {http://halshs.archives-ouvertes.fr/halshs-00308785/en/}, PDF = {http://halshs.archives-ouvertes.fr/halshs-00308785/PDF/Going_down_in_semi_latticesof_Moore_families.pdf}, ABSTRACT = {In this paper we first study the changes occuring in the posets of irreducible elements when one goes from an arbitrary Moore family (respectively, a convex geometry) to one of its lower covers in the lattice of all Moore families (respectively, in the semilattice of all convex geometries) defined on a finite set. Then, we show that the poset of all convex geometries that have the same poset of join-irreducible elements is a ranked join-semilattice, and we give an algorithm for computing it. Finally, we prove that the lattice of all ideals of a given poset P is the only convex geometry having a poset of join-irreducible elements isomorphic to P if and only if the width of P is less than 3.} } @BOOK{Leon07, PUBLISHER = {Springer}, TITLE = {Les ensembles ordonnés finis : concepts, résultats et usages}, YEAR = {2007}, AUTHOR = {Nathalie Caspard and Bruno Leclerc and Bernard Monjardet}, ALTEDITOR = {}, OPTADDRESS = {}, OPTEDITION = {}, OPTMONTH = {}, NOTE = {340 pages}, OPTNUMBER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://halshs.archives-ouvertes.fr/halshs-00197128/fr/} } @PROCEEDINGS{DBLP:conf/europar/NagelGDP07, TITLE = {Topic 2 Performance Prediction and Evaluation}, YEAR = {2007}, OPTADDRESS = {}, EDITOR = {Anne-Marie Kermarrec and Luc Bougé and Thierry Priol}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4641}, AUTHOR = {Wolfgang E. Nagel and Bruno Gaujal and Tugrul Dayar and Nihal Pekergin}, BOOKTITLE = {Parallel Processing, 13th International Euro-Par}, PAGES = {83}, DOI = {10.1007/978-3-540-74466-5_10} } @PHDTHESIS{IGMA_Cer07, AUTHOR = {Julien Cervelle}, SCHOOL = {Université Paris Est, Marne-la-Vall'ee}, TITLE = {Complexité dynamique et algorithmique des automates cellulaires}, YEAR = {2007}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, TYPE = {Habilitation à diriger des recherches (HDR)} } @PHDTHESIS{tran07, AUTHOR = {Minh-Anh Tran}, SCHOOL = {Ecole nationale supérieure des telecommunications - ENST}, TITLE = {Insensibilite dans les reseaux de files d'attente et applications au partage de ressources informatiques}, YEAR = {2007}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, OPTTYPE = {}, URL = {http://tel.archives-ouvertes.fr/tel-00196718/fr/}, PDF = {http://tel.archives-ouvertes.fr/docs/00/19/67/18/PDF/Tran-memoire.pdf} } @ARTICLE{Verlan07b, AUTHOR = {Artiom Alhazov and Yurii Rogozhin and Sergey Verlan}, JOURNAL = {International Journal of Foundations of Computer Science}, TITLE = {Minimal Cooperation in Symport/Antiport Tissue P Systems}, YEAR = {2007}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {163-180}, VOLUME = {18}, DOI = {10.1142/S0129054107004619} } @ARTICLE{Ber2007:PHPSOLUS, AUTHOR = {M. Bernichi}, JOURNAL = {PHP Solutions}, TITLE = {L'intégration du PHP et Java}, YEAR = {2007}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {26-29}, OPTVOLUME = {}, ABSTRACT = {Offrir d'avantage d'ouverture et de compatibilité entre les langages est un paramètre en constante évolution. Le renforcement de PHP 5 sur le déploiement applicatif et la portabilité de Java font de ces langages deux outils puissants. Il n'est cependant pas forcément facile de faire interagir et homogénéiser ces deux langages lors de mise en place de webservices ou applications.} } @ARTICLE{BoeSli:2007:ASMMd, AUTHOR = {E. Börger and Anatol Slissenko}, JOURNAL = {Fundamenta Informaticae}, TITLE = {The Abstract State Machines Method}, YEAR = {2007}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1--2}, PAGES = {i-iii}, VOLUME = {77} } @ARTICLE{IGMA_CerForRou07, AUTHOR = {Julien Cervelle and Rémi Forax and Gilles Roussel}, JOURNAL = {Computer Science and Information Systems}, TITLE = {A simple implementation of grammar libraries}, YEAR = {2007}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {65--77}, VOLUME = {4} } @ARTICLE{IGMA_CerForMas07, AUTHOR = {Julien Cervelle and Enrico Formenti and Benoît Masson}, JOURNAL = {Theoretical Computer Science}, TITLE = {From sandpiles to sand automata}, YEAR = {2007}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1-3}, PAGES = {1--28}, VOLUME = {381}, PUBLISHER = {Elsevier} } @ARTICLE{Verlan07a, AUTHOR = {Erzsébet Csuhaj-Varjú and Maurice Margenstern and György Vaszil and Sergey Verlan}, JOURNAL = {Theoretical Computer Science}, TITLE = {On Small Universal Antiport P Systems}, YEAR = {2007}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2-3}, PAGES = {152-164}, VOLUME = {372}, DOI = {10.1016/j.tcs.2006.11.023} } @ARTICLE{Cegielski:2007:FI, AUTHOR = {Patrick Cégielski and Denis Richard and Maxim Vsemirnov}, JOURNAL = {Fundamenta Informaticae}, TITLE = {On the additive theory of prime numbers}, YEAR = {2007}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {83-96}, VOLUME = {81} } @ARTICLE{Ge:2007:revueISI, AUTHOR = {Frédéric Gervais}, JOURNAL = {Ingénierie des Systèmes d'Information}, TITLE = {EB$^{4}$ : Vers une méthode de spécification formelle des SI}, YEAR = {2007}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {69-93}, VOLUME = {12}, PUBLISHER = {Hermès} } @ARTICLE{clss2007, AUTHOR = {A. Merlin and G. Hains}, JOURNAL = {Computer languages, systems and structures}, TITLE = {A Bulk Synchronous Process Algebra}, YEAR = {2007}, MONTH = {October-November}, NOTE = {Special issue on Semantics and cost models for high-level parallel programming}, NUMBER = {3--4}, OPTPAGES = {}, VOLUME = {33}, PUBLISHER = {Elsevier} } @ARTICLE{tsijfla07, AUTHOR = {Antoine Spicher and Olivier Michel}, JOURNAL = {Technique et Science Informatique}, TITLE = {Représentation et manipulation de structures topologiques dans un langage fonctionnel}, YEAR = {2007}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTPAGES = {}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2007/tsijfla07.pdf} } @ARTICLE{tran07:_balan_elast_traff_sourc, AUTHOR = {Minh-Anh Tran and Thomas Bonald}, JOURNAL = {IEEE Communications Letters}, TITLE = {Balancing Elastic Traffic Sources}, YEAR = {2007}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {11}, PAGES = {692--694}, VOLUME = {8}, URL = {http://ieeexplore.ieee.org/Xplore/login.jsp?url=/iel5/4234/4289986/04290005.pdf?isnumber=4289986&arnumber=4290005} } @ARTICLE{tran07:_flow, AUTHOR = {Minh-Anh Tran and Thomas Bonald}, JOURNAL = {Performance Evaluation}, TITLE = {Flow vs. Time Sampling for Throughput Performance Evaluation}, YEAR = {2007}, MONTH = {1181--1193}, OPTNOTE = {}, OPTNUMBER = {}, OPTPAGES = {}, VOLUME = {64}, URL = {http://portal.acm.org/citation.cfm?id=1284907.1285038&coll=&dl=&CFID=15151515&CFTOKEN=6184618} } @ARTICLE{Verlan07f, AUTHOR = {Sergey Verlan}, JOURNAL = {Journal of Automata, Languages and Combinatorics}, TITLE = {On Minimal Context-Free Insertion-Deletion Systems}, YEAR = {2007}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1-2}, PAGES = {317-328}, VOLUME = {12} } @ARTICLE{YUNES:2007:HAL-00139041:1, AUTHOR = {Jean-Baptiste Yunès and Jean-Francis Michon and Pierre Valarcher}, JOURNAL = {Journal of Integer Sequences}, TITLE = {Mahler's expansion and boolean functions}, YEAR = {2007}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {07--34}, VOLUME = {10}, KEYWORDS = {BDD, Mahler's expansion, enumeration, complexity, boolean function}, URL = {http://hal.archives-ouvertes.fr/hal-00139041/en/}, ABSTRACT = {{T}he substitution of {X} by {X}2 in binomial polynomials generates sequences of integers by {M}ahler's expansion. {W}e give some properties of these integers and a combinatorial interpretation with covers by projection. {W}e also give applications to the classification of boolean functions. {T}his sequence arose from our previous research on classification and complexity of {B}inary {D}ecision {D}iagrams ({BDD}) associated with boolean functions.} } @ARTICLE{PEIS2, AUTHOR = {Mouad Ben mamoun and Ana Busic and Nihal Pekergin}, JOURNAL = {Probability in the Engineering and Informational Sciences}, TITLE = {Generalized class C Markov chains and computation of closed-form bounding distributions}, YEAR = {2007}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {235--260}, VOLUME = {21}, PUBLISHER = {Cambridge University Press} } @INPROCEEDINGS{Verlan07d, AUTHOR = {Artiom Alhazov and Rudolf Freund and Marion Oswald and Sergey Verlan}, BOOKTITLE = {Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, Proceedings}, TITLE = {Partial Halting in P Systems Using Membrane Rules with Permitting Contexts}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Jérôme Olivier Durand-Lose and Maurice Margenstern}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {110-121}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4664}, DOI = {10.1007/978-3-540-74593-8_10} } @INPROCEEDINGS{ArapinisD07, AUTHOR = {M. Arapinis and M. Duflot}, BOOKTITLE = {FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference}, TITLE = {Bounding Messages for Free in Security Protocols}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {V. Arvind and S. Prasad}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {376--387}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4855} } @INPROCEEDINGS{BeauquierDL07, AUTHOR = {D. Beauquier and M. Duflot and Y. Lifshits}, BOOKTITLE = {Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia (CSR)}, TITLE = {Decidability of Parameterized Probabilistic Information Flow}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {V. Diekert and M. V. Volkov and A. Voronkov }, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {82--91}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4649} } @INPROCEEDINGS{Bea:2007:CSIT, AUTHOR = {Danièle Beauquier and Frédéric Gauche}, BOOKTITLE = {Sixth International Conference on Computer Science and Information Technologies (CSIT 2007)}, TITLE = {How to Guarantee Secrecy for Cryptographic Protocols}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {September}, NOTE = {proceedings not yet published}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00138766/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/13/87/66/PDF/SecrecyFull.pdf} } @INPROCEEDINGS{Verlan07h, AUTHOR = {Francesco Bernardini and Marian Gheorghe and Maurice Margenstern and Sergey Verlan}, BOOKTITLE = {International Workshop: Automata for Cellular and Molecular Computing, Budapest, Hungary, August 31, 2007, Proceedings}, TITLE = {How to synchronize the activity of all components of a P system?}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Gy. Vaszil}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {11--23}, PUBLISHER = {MTA SZTAKI}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Verlan07e, AUTHOR = {Francesco Bernardini and Marian Gheorghe and Maurice Margenstern and Sergey Verlan}, BOOKTITLE = {Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings}, TITLE = {Producer/Consumer in Membrane Systems and Petri Nets}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {S. Barry Cooper and Benedikt Löwe and Andrea Sorbi}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {43-52}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4497}, DOI = {10.1007/978-3-540-73001-9_5} } @INPROCEEDINGS{BM2007:IARIA, AUTHOR = {M. Bernichi and F. Mourlin}, BOOKTITLE = {}, TITLE = {Software management based on mobile agents}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {IARIA Logstics}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE Computer Society Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/iciw/BhattiYMM07, AUTHOR = {Muhammad Usman Bhatti and Samir Youcef and Lynda Mokdad and Valérie Monfort}, BOOKTITLE = {International Conference on Internet and Web Applications and Services (ICIW 2007)}, TITLE = {Execution Time Analysis of Aspectized Web Services}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {30}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/ICIW.2007.31} } @INPROCEEDINGS{EPEWA, AUTHOR = {A. Busic and N. Pekergin}, BOOKTITLE = {Formal Methods and Stochastic Models for Performance Evaluation (EPEW07)}, TITLE = {Closed Form absorption time bounds}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {K. Wolter}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {33-47}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {4748} } @INPROCEEDINGS{DBLP:conf/aiccsa/CastelMP07, AUTHOR = {Hind Castel and Lynda Mokdad and Nihal Pekergin}, BOOKTITLE = {5th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)}, TITLE = {Loss rates bounds in IP buffers by Markov chains aggregations}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {623-630}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/AICCSA.2007.370695} } @INPROCEEDINGS{DBLP:conf/mascots/CastelMP07, AUTHOR = {Hind Castel and Lynda Mokdad and Nihal Pekergin}, BOOKTITLE = {15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2007)}, TITLE = {Stochastic Bounds Applied to the End to End QoS in Communication Systems}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {374--380}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/MASCOTS.2007.62} } @INPROCEEDINGS{DBLP:conf/valuetools/Castel-TalebMP07, AUTHOR = {Hind Castel-Taleb and Lynda Mokdad and Nihal Pekergin}, BOOKTITLE = {Proceedings of the 2nd International Conference on Performance Evaluation Methodolgies and Tools (VALUETOOLS 2007)}, TITLE = {Aggregated bounding Markov processes applied to the analysis of tandem queues}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Peter W. Glynn}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {43}, PUBLISHER = {ACM}, SERIES = {ACM International Conference Proceeding Series}, OPTVOLUME = {}, DOI = {10.1145/1345263.1345319} } @INPROCEEDINGS{IGMA_CerForGui07, AUTHOR = {Julien Cervelle and Enrico Formenti and Pierre Guillon}, BOOKTITLE = {3rd Conference on Computability in Europe - Computation and Logic in the Real World (CiE'07)}, TITLE = {Sofic Trace of a Cellular Automaton}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {S. Barry Cooper and Benedict Löwe and Andrea Sorbi}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {152--161}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {4497}, URL = {http://www.springerlink.com/content/r371136036536783/?p=15347994b72748d689ae2d82c90de38d%u03C0=69}, PDF = {http://igm.univ-mlv.fr/~pguillon/bib/trace.pdf} } @INPROCEEDINGS{IGMA_CerGui07, AUTHOR = {Julien Cervelle and Pierre Guillon}, BOOKTITLE = {32th International Symposium on Mathematical Foundations of Computer Science (MFCS'07)}, TITLE = {Towards a Rice Theorem on Traces of Cellular Automata}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Ludek Kucera and Antonìn Kucera}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {310--319}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {4708}, URL = {http://www.springerlink.com/content/7318354x8tk602q1/?p=312d99b60b7445b49acdabfcfe563a0b%u03C0=0}, PDF = {http://igm.univ-mlv.fr/~pguillon/bib/trice.pdf} } @INPROCEEDINGS{Cegielski:2007:CSIT, AUTHOR = {Patrick Cégielski and Irène Guessarian}, BOOKTITLE = {CSIT'2007 ( Computer Science and Information Technologies, September 24--28, 2007, Yerevan, Armenia), The National Academy of Sciences of Armenia Publishers, ISBN 978-99941-2-086-4, 332 p.}, TITLE = {Tree inclusions in windows and slices}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {43-47}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Dima:2007:formats, AUTHOR = {Catalin Dima}, BOOKTITLE = {Proceedings of the 5th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'07), Salzburg, Autriche, 3-5 Octobre 2007}, TITLE = {Dynamical properties of timed automata revisited}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4763}, OPTORGANIZATION = {}, PAGES = {130--146}, PUBLISHER = {Springer Verlag}, SERIES = {LNCS}, OPTVOLUME = {} } @INPROCEEDINGS{DiEn:2007:wits, AUTHOR = {Catalin Dima and C. Enea}, BOOKTITLE = {Proceedings of 7th International Workshop on Issues in the Theory of Security (WITS'07), Braga, Portugal, 24-25 mars 2007}, TITLE = {Nondeducibility on strategies in the Temporal Logic of Knowledge}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {69--84}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DiEnGraSo:2007:synasc, AUTHOR = {Catalin Dima and C. Enea and R. Gramatovici and Al. Sofronia}, BOOKTITLE = {9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 26-29 Septembre 2007, Timisoara, Roumanie}, TITLE = {Strategy-based and knowledge-based models of information flow: equivalence and decidability}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE Computer Society Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DiLa:2007:ictac, AUTHOR = {Catalin Dima and R. Lanotte}, BOOKTITLE = {Proceedings of the 4th International Colloquium on Theoretical Aspects of Computing (ICTAC'07), 26-28 septembre 2007, Macao SAR, Chine}, TITLE = {Distributed time-asynchronous automata}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {185--200}, PUBLISHER = {Springer Verlag}, SERIES = {LNCS}, VOLUME = {4711} } @INPROCEEDINGS{DBLP:conf/ceemas/EneaD07, AUTHOR = {Constantin Enea and Catalin Dima}, BOOKTITLE = {Multi-Agent Systems and Applications, 5th International Central and Eastern European Conference on Multi-Agent Systems, (CEEMAS)}, TITLE = {Abstractions of Multi-agent Systems}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Hans-Dieter Burkhard and Gabriela Lindemann and Rineke Verbrugge and László Zsolt Varga}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {11--21}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {4696}, DOI = {10.1007/978-3-540-75254-7_2} } @INPROCEEDINGS{DBLP:conf/valuetools/FourneauKPVV07, AUTHOR = {Jean-Michel Fourneau and Imène Kadi and Nihal Pekergin and Jérôme Vienne and Jean-Marc Vincent}, BOOKTITLE = {Proceedings of the 2nd International Conference on Performance Evaluation Methodolgies and Tools (VALUETOOLS)}, TITLE = {Perfect simulation and monotone stochastic bounds}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Peter W. Glynn}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {65}, PUBLISHER = {ACM}, SERIES = {ACM International Conference Proceeding Series}, OPTVOLUME = {}, DOI = {10.1145/1345263.1345346} } @INPROCEEDINGS{DBLP:conf/aict/FourneauMPY07, AUTHOR = {Jean-Michel Fourneau and Lynda Mokdad and Nihal Pekergin and Samir Youcef}, BOOKTITLE = {Third Advanced International Conference on Telecommunications (AICT)}, TITLE = {Stochastic Bounds for Loss Rates}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {9}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/AICT.2007.40} } @INPROCEEDINGS{QEST07, AUTHOR = {J.M. Fourneau and N. Pekergin and S. Younès}, BOOKTITLE = {4th International Conference on the Quantitative Evaluaiton of Systems (QEST 2007)}, TITLE = {CUT: Combining stochastic ordering and censoring to bound steady-state rewards and first passage time (tool paper)}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {211--213}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{EPEWS, AUTHOR = {J.M. Fourneau and N. Pekergin and S. Younès}, BOOKTITLE = {Formal Methods and Stochastic Models for Performance Evaluation (EPEW07)}, TITLE = {Censoring Markov Chains and Stochastic Bounds}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {K. Wolter}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {213-227}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {4748} } @INPROCEEDINGS{FrFrGeLaRi:2007:RCIS, AUTHOR = {Marc Frappier and Benoît Fraikin and Frédéric Gervais and Régine Laleau and Mario Richard}, BOOKTITLE = {Proceedings of the First International Conference on Research Challenges in Information Science, RCIS 2007, Ouarzazate, Morocco, April 23-26}, TITLE = {Synthesizing Information Systems: the APIS Project}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Colette Rolland and Oscar Pastor and Jean-Louis Cavarero}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {73-84}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Verlan07g, AUTHOR = {Rudolf Freund and Sergey Verlan}, BOOKTITLE = {Membrane Computing, 8th International Workshop, WMC 2007, Thessaloniki, Greece, June 25-28, 2007 Revised Selected and Invited Papers}, TITLE = {A Formal Framework for Static (Tissue) P Systems}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {George Eleftherakis and Petros Kefalas and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {271-284}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4860}, DOI = {10.1007/978-3-540-77312-2_17} } @INPROCEEDINGS{GAVA2007:ICCS, AUTHOR = {Frédéric Gava}, BOOKTITLE = {The International Conference on Computational Science (ICCS), Part I}, TITLE = {Implementation of the Parallel Superposition in Bulk-Synchronous Parallel ML}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Y. Shi and G.D.v. Albada and J. Dongarra and P.M.A. Sloot}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {611--619}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {4487}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_iccs_2007.pdf}, DOI = {10.1007/978-3-540-72584-8_81} } @INPROCEEDINGS{GeFrLa:2007:confB, AUTHOR = {Frédéric Gervais and Marc Frappier and Régine Laleau}, BOOKTITLE = {B 2007: Formal Specification and Development in B, 7th International Conference of B Users, Besançon, France, January 17-19}, TITLE = {Refinement of EB3 Process Patterns into B Specifications}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Jacques Julliand and Olga Kouchnarenko}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {201-215}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4355} } @INPROCEEDINGS{colsec07, AUTHOR = {G. Hains}, BOOKTITLE = {Workshop on Collaboration and Security (COLSEC'07), part of The 2007 International Symposium on Collaborative Technologies and Systems (CTS'07)}, TITLE = {Efficient static checking of dynamic access control in shared multiprocessor environments}, YEAR = {2007}, ADDRESS = {Orlando (FL), USA}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {May}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://www.univ-orleans.fr/lifo/Manifestations/COLSEC/} } @INPROCEEDINGS{VTI7, AUTHOR = {I. Kadi and J.M. Fourneau and N. Pekergin and J. Vienne and J.M. Vincent}, BOOKTITLE = {Value Tools, 2nd International Conference on Performance Evaluation Methodologies and Tools}, TITLE = {Perfect simulation and Monotone Stochastic Bounds}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {to appear}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {ACM Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{LaLeBe:2007:RCIS, AUTHOR = {Régine Laleau and Yves Ledru and Didier Bert and Fabrice Bouquet and Michel Lemoine and Catherine Dubois and Véronique Donzeau-Gouge and Sylvie Vignes}, BOOKTITLE = {Proceedings of the First International Conference on Research Challenges in Information Science, RCIS 2007, Ouarzazate, Morocco, April 23-26}, TITLE = {Using Computer Science Modeling Techniques for Airport Security Certification}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Colette Rolland and Oscar Pastor and Jean-Louis Cavarero}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {61-72}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Verlan07c, AUTHOR = {Artiom Matveevici and Yurii Rogozhin and Sergey Verlan}, BOOKTITLE = {Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, Proceedings}, TITLE = {Insertion-Deletion Systems with One-Sided Contexts}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Jérôme Olivier Durand-Lose and Maurice Margenstern}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {205-217}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4664}, DOI = {10.1007/978-3-540-74593-8_18} } @INPROCEEDINGS{ifl07, AUTHOR = {Olivier Michel and Jean-Louis Giavitto}, BOOKTITLE = {19th International Symposium on Implementation and Application of Functional Languages}, TITLE = {Incremental extension of a domain specific language interpreter}, YEAR = {2007}, ADDRESS = {Freiburg, Germany}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {27--29 September}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2007/ifl07.pdf}, ABSTRACT = {We have developed an interpreter for the domain-specific language MGS using OCAML as the implementation language. In this third implementation of MGS, we wanted to provide the end-user with easy incremental addition of new data structures and their associated functions to the language. We detail in this paper our solution, in a functional setting, which is based on techniques similar to those found in aspect-oriented programming.} } @INPROCEEDINGS{pelz07:_formal_model_multic_traff_networ, AUTHOR = {E. Pelz and D. Tutsch}, BOOKTITLE = {ICATPN}, TITLE = {Formal Models for Multicast Traffic in Network on Chip Architectures with Compositional High Level Petri Nets}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {381-401}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {4546} } @INPROCEEDINGS{INFINITY07, AUTHOR = {Franck Pommereau and Raymond Devillers and Hanna Klaudel}, BOOKTITLE = {}, TITLE = {Efficient reachability graph representation of Petri nets with unbounded counters}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {y}, OPTORGANIZATION = {}, PAGES = {1-10}, PUBLISHER = {Elsevier}, SERIES = {Electronic Notes in Theoretical Computer Science}, VOLUME = {xx}, KEYWORDS = {Petri nets, unbounded integers, reachability, traces}, ABSTRACT = {In this paper, we define a class of Petri nets, called Petri nets with counters, that can be seen as place/transition Petri nets enriched with a vector of integer variables on which linear operations may be applied. Their semantics usually leads to huge or infinite reachability graphs. Then, a more compact representation for this semantics is defined as a symbolic state graph whose nodes possibly encode infinitely many values for the variables. Both representations are shown behaviourally equivalent.} } @INPROCEEDINGS{DBLP:conf/cade/VerchinineLP07, AUTHOR = {Konstantin Verchinine and Alexander V. Lyaletski and Andrey Paskevich}, BOOKTITLE = {Automated Deduction - CADE-21, 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007, Proceedings}, TITLE = {System for Automated Deduction (SAD): A Tool for Proof Verification}, YEAR = {2007}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Frank Pfenning}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {398-403}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4603}, DOI = {10.1007/978-3-540-73595-3_29} } @TECHREPORT{dima-nds, AUTHOR = {C. Dima and C. Enea and R. Gramatovici}, INSTITUTION = {LACL}, TITLE = {Nondeterministic nointerference and deducible information flow}, YEAR = {2007}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2007-11}, OPTTYPE = {} } @TECHREPORT{GeFrLa:2007:RT18, AUTHOR = {Frédéric Gervais and Marc Frappier and Régine Laleau}, INSTITUTION = {Université de Sherbrooke (Québec)}, TITLE = {Comparing Different Combinations of Event-based and State-based Specifications for IS Modelling}, YEAR = {2007}, ADDRESS = {Canada}, MONTH = {April}, OPTNOTE = {}, NUMBER = {18}, OPTTYPE = {} } @UNPUBLISHED{CEGIELSKI:2007:HAL-00159127:1, AUTHOR = {Patrick Cegielski and Irene Guessarian}, NOTE = {}, TITLE = {Tree inclusions in windows and slices}, OPTMONTH = {}, YEAR = {2007}, KEYWORDS = {Subtree inclusion, algorithm}, URL = {http://hal.archives-ouvertes.fr/hal-00159127/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/15/91/27/PDF/cg.pdf}, ABSTRACT = {${P}$ is an embedded subtree of ${T}$ if ${P}$ can be obtained by deleting some nodes from ${T}$: if a node $v$ is deleted, all edges adjacent to $v$ are also deleted, and outgoing edges are replaced by edges going from the parent of $v$ (if it exists) to the children of $v$. {D}eciding whether ${P}$ is an embedded subtree of ${T}$ is known to be {NP}-complete. {G}iven two trees (a target ${T}$ and a pattern ${P}$) and a natural number $w$, we address two problems: 1. counting the number of windows of ${T}$ having height exactly $w$ and containing pattern ${P}$ as an embedded subtree, and 2. counting the number of slices of ${T}$ having height exactly $w$ and containing pattern ${P}$ as an embedded subtree.} } @UNPUBLISHED{DUMONT:2007:HAL-00186756:1, AUTHOR = {Cyril Dumont and Fabrice Mourlin}, NOTE = {}, TITLE = {A Mobile Computing Architecture for Numerical Simulation}, OPTMONTH = {}, YEAR = {2007}, URL = {http://hal.archives-ouvertes.fr/hal-00186756/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/18/67/56/PDF/2993a068.pdf}, ABSTRACT = {{T}he domain of numerical simulation is a place where the parallelization of numerical code is common. {T}he definition of a numerical context means the configuration of resources such as memory, processor load and communication graph, with an evolving feature: the resources availability. {A} feature is often missing: the adaptability. {I}t is not predictable and the adaptable aspect is essential. {W}ithout calling into question these implementations of these codes, we create an adaptive use of these implementations. {B}ecause the execution has to be driven by the availability of main resources, the components of a numeric computation have to react when their context changes. {T}his paper offers a new architecture, a mobile computing architecture, based on mobile agents and {J}ava{S}pace. {A}t the end of this paper, we apply our architecture to several case studies and obtain our first results.} } @PROCEEDINGS{MiVaYu:2006:bfca, TITLE = {Boolean Functions: Application and Cryptography}, YEAR = {2006}, OPTADDRESS = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PUBLISHER = {Presse Universitaire de Rouen et du Havre}, OPTSERIES = {}, OPTVOLUME = {}, PAGES = {200} } @PROCEEDINGS{jalc2006-sasyft2004, TITLE = {Selected Papers of the International Workshop on Security Analysis of Systems: Formalisms and Tools (SASYFT2004)}, YEAR = {2006}, OPTADDRESS = {}, EDITOR = {S. Anantharaman and P. Gastin and G. Hains and J. Mullins and M. Rusinowitch}, OPTMONTH = {}, NOTE = {SASYFT2004 was held at LIFO-Orléans in 2004}, NUMBER = {1}, ORGANIZATION = {Journal of Automata, Languages and Combinatorics (Otto von Guericke-Universität, Magdeburg)}, OPTPUBLISHER = {}, OPTSERIES = {}, VOLUME = {11}, BOOKTITLE = {Selected Papers of the International Workshop on Security Analysis of Systems: Formalisms and Tools (SASYFT2004)} } @PROCEEDINGS{DiMiTi:2006:ics, TITLE = {Proceedings of 1st Workshop in Information and Computer Security}, YEAR = {2006}, OPTADDRESS = {}, EDITOR = {Catalin Dima and Marius Minea and Ferucio Tiplea}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PUBLISHER = {Elsevier}, SERIES = {Electronic Notes in Theoretical Computer Science}, VOLUME = {186} } @PROCEEDINGS{LaLe:2006:REMO2V, TITLE = {Proceedings of the CAISE'06 Workshop on Regulations Modelling and their Validation and Verification, ReMo2V-2006, Luxemburg, June 5-9}, YEAR = {2006}, OPTADDRESS = {}, EDITOR = {Régine Laleau and Michel Lemoine}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PUBLISHER = {CEUR-Workshop Proceedings}, OPTSERIES = {}, OPTVOLUME = {}, BOOKTITLE = {ReMo2V-2006}, URL = {http://CEUR-WS.org/Vol-241/} } @PROCEEDINGS{valarcher:bfca2006, TITLE = {Boolean Functions: Application and Cryptography}, YEAR = {2006}, OPTADDRESS = {}, EDITOR = {J.-F. Michon and P. Valarcher and J.-B. Yunès}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PUBLISHER = {Presse Universitaire de Rouen et du Havre}, OPTSERIES = {}, OPTVOLUME = {} } @PHDTHESIS{Ge:2006:phdThesis, AUTHOR = {Frédéric Gervais}, SCHOOL = {}, TITLE = {Combinaison de spécifications formelles pour la modélisation des systèmes d'information}, YEAR = {2006}, OPTADDRESS = {}, MONTH = {December}, OPTNOTE = {}, OPTTYPE = {}, INSTITUTION = {CNAM, France, and Université de Sherbrooke (Québec), Canada} } @INBOOK{DFPV06, PUBLISHER = {Boson Books}, TITLE = {Polynomials of a stochastic matrix and strong stochastic bounds}, YEAR = {2006}, AUTHOR = {T. Dayar and J.-M. Fourneau and N. Pekergin and J.-M. Vincent}, ALTCHAPTER = {}, EDITOR = {A. N. Langville and W. J. Stewart}, PAGES = {211-228}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {}, BOOKTITLE = {MAM 2006: Markov Anniversary Meeting} } @INBOOK{DKN+06:book, PUBLISHER = {}, TITLE = {Practical Applications of Probabilistic Model Checking to Communication Protocols}, YEAR = {2006}, AUTHOR = {Marie Duflot and Marta Kwiatkowska and Gethin Norman and David Parker and Sylvain Peyronnet and Claudine Picaronny and Jeremy Sproston}, ALTCHAPTER = {}, ALTEDITOR = {}, ALTPAGES = {}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTMONTH = {}, NOTE = {To appear}, OPTNUMBER = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @INBOOK{GeFrSt:2006:chapitreEB3, PUBLISHER = {ISTE}, TITLE = {Software Specification Methods}, YEAR = {2006}, AUTHOR = {Frédéric Gervais and Marc Frappier and R. St-Denis}, CHAPTER = {EB$^{3}$}, ALTEDITOR = {}, PAGES = {259-274}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @INBOOK{BBFP06, PUBLISHER = {Boson Books}, TITLE = {Increasing convex monotone Markov chains: Theory, algorithm and applications}, YEAR = {2006}, AUTHOR = {M. Ben Mamoun and A. Busic and J.-M. Fourneau and N. Pekergin}, ALTCHAPTER = {}, EDITOR = {A. N. Langville and W. J. Stewart}, PAGES = {189-210}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {}, BOOKTITLE = {MAM 2006: Markov Anniversary Meeting} } @INBOOK{bordeaux06, PUBLISHER = {Genopole}, TITLE = {Rewriting and Simulation - Application to the Modeling of the Lambda Phage Switch}, YEAR = {2006}, AUTHOR = {Antoine Spicher and Olivier Michel and Jean-Louis Giavitto}, CHAPTER = {Modeling of the Lambda Phage Switch}, ALTEDITOR = {}, ALTPAGES = {}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {5}, OPTSERIES = {}, OPTTYPE = {}, VOLUME = {Modélisation de systèmes biologiques complexes dans le contexte de la génomique}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2006/phage-spicher-michel.pdf}, ABSTRACT = {A modeling of the Lambda Phage Switch using the MGS language.} } @INCOLLECTION{LaMa:2006:Hermes, AUTHOR = {Régine Laleau and Amel Mammar}, BOOKTITLE = {Software Specification Methods : an Overview Using a Case Study}, PUBLISHER = {Hermes Science Publishing, ISTE London}, TITLE = {From UML Diagrams to B Specifications}, YEAR = {2006}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {Marc Frappier and Henri Habrias}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {60--79}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00145958/en/} } @INCOLLECTION{Sliss:2006:PTMS, AUTHOR = {Anatol Slissenko}, BOOKTITLE = {Proceeding of NATO Advanced Research Workshop: Verification of Infinite-State Systems with Applications to Security (VISSAS 2005), Timisoara, March 17--22, 2005}, PUBLISHER = {IOS Press}, TITLE = {Probability and Time in Measuring Security}, YEAR = {2006}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {E. Clarke, M. Minea, F. L. Tiplea}, OPTMONTH = {}, NOTE = {NATO Security through Science Series. D : Information and Communication Security -- Vol. 1.}, OPTNUMBER = {}, PAGES = {169--183}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @ARTICLE{DBLP:journals/mst/AilloudD06, AUTHOR = {Étienne Ailloud and Arnaud Durand}, JOURNAL = {Theory Comput. Syst.}, TITLE = {The Expressive Power of Bijections over Weakly Arithmetized Structures}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {297-309}, VOLUME = {39}, DOI = {10.1007/s00224-005-1165-y} } @ARTICLE{BeRaSl:2006:JLC, AUTHOR = {Danièle Beauquier and Alexander Rabinovich and Anatol Slissenko}, JOURNAL = {Journal of Logic and Computation}, TITLE = {A logic of probability with decidable model-checking}, YEAR = {2006}, MONTH = {July}, OPTNOTE = {}, NUMBER = {4}, PAGES = {461-487}, VOLUME = {16} } @ARTICLE{BeSl:2006:APAL, AUTHOR = {Danièle Beauquier and Anatol Slissenko}, JOURNAL = {Annals of Pure and Applied Logic}, TITLE = {Periodicity Based Decidable Classes in a First Order Timed Logic}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1--3}, PAGES = {43--73}, VOLUME = {139}, PDF = {http://hal.archives-ouvertes.fr/docs/00/11/69/50/PDF/DcdblPeriod04FebTechCorr.pdf}, DOI = {10.1016/j.apal.2005.03.003} } @ARTICLE{DBLP:journals/ijfcs/BesC06, AUTHOR = {Alexis Bès and Olivier Carton}, JOURNAL = {Int. J. Found. Comput. Sci.}, TITLE = {A Kleene Theorem for Languages of Words Indexed by Linear Orderings}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {519-542}, VOLUME = {17}, DOI = {10.1142/S0129054106003978} } @ARTICLE{CrLaVa:2006:njc, AUTHOR = {Tristan Crolard and Samuel Lacas and Pierre Valarcher}, JOURNAL = {Nordic Journal of Computing}, TITLE = {On the Expressive Power of the Loop Language}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1-2}, PAGES = {46-57}, VOLUME = {13}, URL = {http://hal.ccsd.cnrs.fr/ccsd-00089848/en/} } @ARTICLE{Cegielski:2006:IPL, AUTHOR = {Patrick Cégielski and Irène Guessarian and Yuri Matiyasevich}, JOURNAL = {Information Processing Letter}, TITLE = {Multiple serial episodes matching}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {211-218}, VOLUME = {98} } @ARTICLE{Cegielski:2006:TCS2, AUTHOR = {Patrick Cégielski and de Queiroz, Ruy}, JOURNAL = {Theoretical Computer Science - B}, TITLE = {Foreword WoLLIC'04}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {143-270}, VOLUME = {364} } @ARTICLE{DuflotKNP06, AUTHOR = {M. Duflot and M. Z. Kwiatkowska and G. Norman and D. Parker}, JOURNAL = {STTT}, TITLE = {A formal analysis of bluetooth device discovery}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {6}, PAGES = {621--632}, VOLUME = {8} } @ARTICLE{DBLP:journals/corr/abs-cs-0605008, AUTHOR = {Arnaud Durand and Etienne Grandjean}, JOURNAL = {CoRR}, TITLE = {The complexity of acyclic conjunctive queries revisited}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTPAGES = {}, VOLUME = {abs/cs/0605008}, URL = {http://arxiv.org/abs/cs/0605008} } @ARTICLE{GAVA2006:TSI, AUTHOR = {Frédéric Gava}, JOURNAL = {Technique et Science Informatiques}, TITLE = {Une bibliothèque certifiée de programmes fonctionnels BSP}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {10}, PAGES = {1261--1280}, VOLUME = {25}, URL = {http://tsi.revuesonline.com/article.jsp?articleId=9379}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_tsi_2006.pdf} } @ARTICLE{LaViLe:2006:SPIP, AUTHOR = {Régine Laleau and S. Vignes and Y. Ledru and M. Lemoine and D. Bert and V. Donzeau-Gouge and C. Dubois and F. Peureux}, JOURNAL = {Software Process: Improvement and Practice (SPIP)}, TITLE = {Adopting a situational requirements engineering approach for the analysis of civil aviation security standards}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {5}, PAGES = {487-503}, VOLUME = {11}, PUBLISHER = {John Wiley & Sons}, URL = {http://hal.archives-ouvertes.fr/hal-00147053/en/} } @ARTICLE{DBLP:journals/japll/LyaletskiPV06, AUTHOR = {Alexander V. Lyaletski and Andrey Paskevich and Konstantin Verchinine}, JOURNAL = {J. Applied Logic}, TITLE = {SAD as a mathematical assistant - how should we go from here to there?}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {560-591}, VOLUME = {4}, DOI = {10.1016/j.jal.2005.10.009} } @ARTICLE{MaLa:2006:AUSE, AUTHOR = {Amel Mammar and Régine Laleau}, JOURNAL = {Automated Software Engineering}, TITLE = {A formal approach based on UML and B for the specification and development of database applications}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {497--528}, VOLUME = {13}, PUBLISHER = {Springer}, URL = {http://hal.archives-ouvertes.fr/hal-00147056/en/} } @ARTICLE{MaLa:2006:IST, AUTHOR = {Amel Mammar and Régine Laleau}, JOURNAL = {Information & Software Technology}, TITLE = {From a B formal specification to an executable code: application to the relational database domain.}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {253-279}, VOLUME = {48}, PUBLISHER = {Elsevier}, URL = {http://hal.archives-ouvertes.fr/hal-00145868/en/} } @ARTICLE{MaLa:2006:JDM, AUTHOR = {Amel Mammar and Régine Laleau}, JOURNAL = {Journal of Database Management}, TITLE = {UB2SQL: A Tool for Building Database Applications Using UML and B Formal Method.}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {70-89}, VOLUME = {17}, PUBLISHER = {Idea Group Publishing} } @ARTICLE{ijuc06, AUTHOR = {Olivier Michel and Jean-Pierre Banâtre and Pascal Fradet and Jean-Louis Giavitto}, JOURNAL = {International Journal of Unconventional Computing}, TITLE = {Challenging Questions for the Rationales of Non-Classical Programming Languages}, YEAR = {2006}, OPTMONTH = {}, NOTE = {accepted for publishing}, OPTNUMBER = {}, OPTPAGES = {}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2006/final-ijuc-michel-banatre-fradet-giavitto-position-paper.pdf}, ABSTRACT = {In this position paper, we question the rationale behind the design of unconventional programming languages. Our questions are classified in four categories: the sources of inspiration for new computational models, the process of developing a program, the forms and the theories needed to write and understand nonclassical programs and finally the new computing media and the new applications that drive the development of new programming languages.} } @ARTICLE{DBLP:journals/jcm/RojasBSM06, AUTHOR = {Octavio Ramirez Rojas and Jalel Ben-Othman and Safouane Sfar and Lynda Mokdad}, JOURNAL = {JCM}, TITLE = {VIP (VHE in Mobile IP Networks) Architecture}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {5}, PAGES = {28--38}, VOLUME = {1}, URL = {http://www.academypublisher.com/jcm/vol01/no05/jcm01052838.html} } @ARTICLE{spicher05bio, AUTHOR = {Antoine Spicher and Olivier Michel}, JOURNAL = {BioSystems}, TITLE = {Declarative modeling of a neurulation-like process}, YEAR = {2006}, MONTH = {February}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {281-288}, VOLUME = {87}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2006/biosystem06.pdf}, ABSTRACT = { {MGS} is an experimental programming language dedicated to the modeling and the simulation of a special kind of discrete dynamical systems. \emph{Dynamical systems with a dynamical structure} (or DS2) arise when the state space is not fixed \emph{a priori} but is jointly computed with the current state during the simulation. In this case the evolution function is often given through local rules that drive the interaction between some system components. {MGS} offers a new kind of data structure, \emph{topological collections}, to describe the state of a dynamical system, and a new kind of control structure, \emph{transformations}, to express local and discrete evolution laws. These two notions permit an easy specification of DS2. We propose in this paper a presentation of the {MGS} language and its main contributions. We show that various topological collections can be unified using concepts developed in combinatorial algebraic topology: \emph{cellular complexes} and \emph{topological chains}. Then we apply the notions brought by {MGS} to model and simulate the first step towards the simulation of the neurulation process in developmental biology where a sheet of cells evolves to a neural tube. It is a direct description of the modification of the topology of an arbitrary structure expressed in terms of local discrete evolution laws.} } @ARTICLE{DBLP:journals/acta/TipleaE06, AUTHOR = {Ferucio Laurentiu Tiplea and Constantin Enea}, JOURNAL = {Acta Inf.}, TITLE = {Abstractions of data types}, YEAR = {2006}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {8-9}, PAGES = {639-671}, VOLUME = {42}, DOI = {10.1007/s00236-006-0010-3} } @INPROCEEDINGS{BaGeFrLa:2006:AFADLb, AUTHOR = {Panawe Batanado and Frédéric Gervais and Marc Frappier and Régine Laleau}, BOOKTITLE = {Session outils, Approches Formelles dans l'Assistance au Développement de Logiciels, AFADL'06}, TITLE = {EB3TG : Un outil de génération de transactions de base de données relationnelle pour EB3.}, YEAR = {2006}, ADDRESS = {Paris, France}, OPTCROSSREF = {}, EDITOR = {ENST Paris}, MONTH = {Mars}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Bea:2006:FAST, AUTHOR = {Danièle Beauquier and R. Lanotte}, BOOKTITLE = {Fourth International Workshop on Formal Aspects in Security and Trust (FAST2006)}, TITLE = {Hiding Information in Multi Level Systems}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {September}, NOTE = {post-proceedings not yet published}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/aiccsa/Ben-OthmanMR06, AUTHOR = {Jalel Ben-Othman and Lynda Mokdad and Octavio Ramirez Rojas}, BOOKTITLE = {IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2006)}, TITLE = {ATHOMIC: Architecture managing Tcp Handoff Over Mobile Ip Connections}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {70--73}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=33913&arnumber=1618334&count=182&index=9} } @INPROCEEDINGS{ICSNC06, AUTHOR = {M. Bernichi and F. Mourlin}, BOOKTITLE = {International Conference on Systems and Networks Communications}, TITLE = {Mobile agent communication scheme (an evolving canvas)}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {IARIA Logstics}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE Computer Society Press}, OPTSERIES = {}, OPTVOLUME = {}, ABSTRACT = {This paper presents a communication scheme for flexible and adaptive mobile agent system (or community of agent). The scheme associates each mobile agent with a set of roles, each of them belong to a communication layer. This allows the decoupling between the roles and physical locations or responsibilities of the mobile agents. Thus, the messages are typed by the layer that supports them. By separating the concerns of locating the mobile agent and delivering the message to the agent, we create a flexible protocol of data exchange.} } @INPROCEEDINGS{BOUROULET:2006:HAL-00340477:1, AUTHOR = {Roland Bouroulet and Hanna Klaudel and Elisabeth Pelz}, BOOKTITLE = {International Conference on Application of Concurrency to System Design, ACSD2006 International Conference on Application of Concurrency to System Design, ACSD2006}, TITLE = {Modelling and verification of authentication using enhanced net semantics of SPL (Security Protocol Language)}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00340477/en/}, ABSTRACT = {{T}his paper proposes an enhanced translation of {S}ecurity {P}rotocol {L}anguage ({SPL}) in high-level {P}etri nets in order to allow to prove automatically, using model-checking techniques, the authentication property of {N}eedham-{S}chroeder-{L}owe ({NSL}) protocol. {T}he proposed approach generates finite nets and goes this way beyond the limitation which was imposed by the previous semantics due to the treatment of the replication operator. {I}n order to reach this goal, we modify the way attacks are modelled. {D}ue to fact that the presented approach focuses on the treatment of the protocol environment, it may be successfully reused for automated verification of properties of other security protocols.} } @INPROCEEDINGS{DBLP:conf/aict/Boutrous-SaabMM06, AUTHOR = {Céline Boutrous-Saab and Tarek Melliti and Lynda Mokdad}, BOOKTITLE = {Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW 2006)}, TITLE = {Performance evaluation for mobile access to compositeWeb services}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {154}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/AICT-ICIW.2006.148} } @INPROCEEDINGS{DBLP:conf/epew/BusicFP06, AUTHOR = {A. Busic and J.-M. Fourneau and N. Pekergin}, BOOKTITLE = {Formal Methods and Stochastic Models for Performance Evaluation, Third European Performance Engineering Workshop (EPEW)}, TITLE = {Worst Case Analysis of Batch Arrivals with the Increasing Convex Ordering.}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {A. Horváth and M. Telek}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {196-210}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {4054}, DOI = {10.1007/11777830_14} } @INPROCEEDINGS{patras, AUTHOR = {H. Castel and L. Mokdad and N. Pekergin}, BOOKTITLE = {Communication Systems, Networks and Digital Signal Processing (CSNDP06)}, TITLE = {Stochastic ordering based Markov process aggregations: application to tandem queues}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/aiccsa/Castel-TalebMP06, AUTHOR = {Hind Castel-Taleb and Lynda Mokdad and Nihal Pekergin}, BOOKTITLE = {IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2006)}, TITLE = {Loss rates bounds for IP switches in MPLS networks}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {208--214}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=33913&arnumber=1618356&count=182&index=31} } @INPROCEEDINGS{IGMA_CerForRou06, AUTHOR = {Julien Cervelle and Rémi Forax and Gilles Roussel}, BOOKTITLE = {4th International Conference on Principles and Practices of Programming in Java (PPPJ'06)}, TITLE = {Tatoo: An innovative Parser Generator}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Ralf Gitzel and Markus Alesky and Matin Schader and Chandra Krintz}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {13--20}, OPTPUBLISHER = {}, SERIES = {ACM International Conferenc Proceedings}, OPTVOLUME = {} } @INPROCEEDINGS{Verlan06a, AUTHOR = {Erzsébet Csuhaj-Varjú and Maurice Margenstern and György Vaszil and Sergey Verlan}, BOOKTITLE = {Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February 3, 2006. Volume I}, TITLE = {Small Computationally Complete Symport/Antiport P Systems}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Miguel Angel Gutiérrez-Naranjo and Gheorghe Paun and Agustìn Riscos-Núñez and Francisco José Romero-Campero}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {267--282}, PUBLISHER = {Fénix Editora}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Verlan06b, AUTHOR = {Erzsébet Csuhaj-Varjú and Sergey Verlan}, BOOKTITLE = {DNA Computing, 12th International Meeting on DNA Computing, DNA12, Seoul, Korea, June 5-9, 2006, Revised Selected Papers}, TITLE = {Length-Separating Test Tube Systems}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Chengde Mao and Takashi Yokomori}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {58-70}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4287}, DOI = {10.1007/11925903_5} } @INPROCEEDINGS{Cegielski:2006:LNCS, AUTHOR = {Patrick Cégielski and Irène Guessarian and Yuri Lifshits and Yuri Matiyasevich}, BOOKTITLE = {Computer Science: Theory and Applications}, TITLE = {Window Subsequence Problem for Compressed Texts}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {127--136}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {3697} } @INPROCEEDINGS{GAVA2006:JFLA, AUTHOR = {Frédéric Gava}, BOOKTITLE = {Journées Francophones des Langages Applicatifs (JFLA)}, TITLE = {Une implantation de la juxtaposition parallèle}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {P.-E. Moreau and T. Hardin}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {87--100}, PUBLISHER = {INRIA}, SERIES = {Collection Didactique}, OPTVOLUME = {}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_jfla_2006.pdf} } @INPROCEEDINGS{Ge:2006:INFORSID, AUTHOR = {Frédéric Gervais}, BOOKTITLE = {24ème Congrès INFORSID}, TITLE = {EB$^{4}$ : Vers une méthode de spécification formelle des SI}, YEAR = {2006}, ADDRESS = {Hammamet, Tunisia}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {1-3 June}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {561-576}, PUBLISHER = {INFORSID}, OPTSERIES = {}, VOLUME = {2} } @INPROCEEDINGS{GeBaFrLa:2006:ICEIS, AUTHOR = {Frédéric Gervais and Panawé Batanado and Marc Frappier and Régine Laleau}, BOOKTITLE = {ICEIS 2006 - Proceedings of the Eighth International Conference on Enterprise Information Systems: Databases and Information Systems Integration, Paphos, Cyprus, May 23-27, 2006}, TITLE = {EB3TG: A Tool Synthesizing Relational Database Transactions from EB3 Attribute Definitions.}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Yannis Manolopoulos and Joaquim Filipe and Panos Constantopoulos and José Cordeiro}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {44-51}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00145866/en/} } @INPROCEEDINGS{GeBaFrLa:2006:AFADLa, AUTHOR = {Frédéric Gervais and Panawe Batanado and Marc Frappier and Régine Laleau}, BOOKTITLE = {Approches Formelles dans l'Assistance au Développement de Logiciels, AFADL'06}, TITLE = {Génération automatique de transactions de base de données relationnelle à partir de définitions d'attributs EB3.}, YEAR = {2006}, ADDRESS = {Paris, France}, OPTCROSSREF = {}, EDITOR = {rapport S002 ENST Paris}, MONTH = {Mars}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {25--39}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00145960/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/14/59/60/PDF/RC978.pdf} } @INPROCEEDINGS{GGLD2006:RENPAR, AUTHOR = {Louis Gesbert and Frédéric Gava and Frédéric Loulergue and Frédéric Dabrowski}, BOOKTITLE = {Rencontres Francophones du Parallélisme (Renpar'17)}, TITLE = {Bulk Synchronous Parallel ML avec exceptions}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gesbert_gava_loulergue_dabrowski_renpar_2006.pdf} } @INPROCEEDINGS{GGLD2006:DAPSYS, AUTHOR = {Louis Gesbert and Frédéric Gava and Frédéric Loulergue and Frédéric Dabrowski}, BOOKTITLE = {Distributed and Parallel Systems (DAPSYS 2006)}, TITLE = {Bulk Synchronous Parallel ML with Exceptions}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {P. Kacsuk and T. Fahringer and Z. Nemeth}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {33--42}, PUBLISHER = {Springer-Verlag}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gesbert_gava_loulergue_dabrowski_dapsys_2006.pdf} } @INPROCEEDINGS{DBLP:conf/apn/HaddadMM06, AUTHOR = {Serge Haddad and Lynda Mokdad and Patrice Moreaux}, BOOKTITLE = {Petri Nets and Other Models of Concurrency - ICATPN 2006, 27th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency}, TITLE = {A New Approach to the Evaluation of Non Markovian Stochastic Petri Nets}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Susanna Donatelli and P. S. Thiagarajan}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {221--240}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {4024}, DOI = {10.1007/11767589_13} } @INPROCEEDINGS{LeLaLe:2006:CAISE, AUTHOR = {Y. Ledru and Régine Laleau and M. Lemoine and S. Vignes and D. Bert and V. Donzeau-Gouge and C. Dubois and F. Peureux}, BOOKTITLE = {CAISE Forum 2006 - Proceedings of the Forum of the 18th International Conference on Advanced Information Systems Engineering, Luxembourg, June 9, 2006}, TITLE = {An attempt to combine UML and formal methods to model airport security.}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {N. Boudjlida, N. Guelfi}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {47--50}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{LBGL2006:CSR, AUTHOR = {Frédéric Loulergue and Radia Benheddi and Frédéric Gava and Dimitri Louis-Regis}, BOOKTITLE = {International Computer Science Symposium in Russia (CSR 2006)}, TITLE = {Bulk Synchronous Parallel ML: Semantics and Implementation of the Parallel Juxtaposition}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {D. Grigoriev and J. Harrison and E.A. Hirsch}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {475--486}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {3967}, PDF = {http://lacl.univ-paris12.fr/gava/papers/loulergue_benheddi_gava_csr_2006.pdf}, DOI = {10.1007/11753728_48} } @INPROCEEDINGS{MaGeLa:2006:INFORSID, AUTHOR = {Amel Mammar and Frédéric Gervais and Régine Laleau}, BOOKTITLE = {Actes du XXIVème Congrès INFORSID, Hammamet, Tunisie, 1-3 Juin, 2006}, TITLE = {Systematic identification of preconditions from set-based integrity constraints}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {595--610}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{postaBPY06, AUTHOR = {M. Ben Mamoun and N. Pekergin and S. Younès}, BOOKTITLE = {Positive Systems, Proceedings of the Second Multidisciplinary International Symposium on Positive Systems: Theory and Applications (POSTA 06)}, TITLE = {Class C Markov chains and transient analysis}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {C. Commault and N. Marchand}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {161--168}, PUBLISHER = {Springer}, SERIES = {LNCIS}, VOLUME = {341} } @INPROCEEDINGS{DBLP:conf/qest/MamounPY06, AUTHOR = {M. Ben Mamoun and N. Pekergin and S. Younès}, BOOKTITLE = {3th International Conference on the Quantitative Evaluaiton of Systems QEST06}, TITLE = {Model Checking of Continuous-Time Markov Chains by Closed-Form Bounding Distributions}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {189-198}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/QEST.2006.33} } @INPROCEEDINGS{DBLP:conf/valuetools/MokdadS06, AUTHOR = {Lynda Mokdad and Mbaye Sene}, BOOKTITLE = {Proceedings of the 1st International Conference on Performance Evaluation Methodolgies and Tools (VALUETOOLS 2006)}, TITLE = {Performance measures of a call admission control in mobile networks using SWN}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Luciano Lenzini and Rene L. Cruz}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {64}, PUBLISHER = {ACM}, SERIES = {ACM International Conference Proceeding Series}, VOLUME = {180}, DOI = {10.1145/1190095.1190177} } @INPROCEEDINGS{DBLP:conf/cade/Paskevich06, AUTHOR = {Andrey Paskevich}, BOOKTITLE = {Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings}, TITLE = {Connection Tableaux with Lazy Paramodulation}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Ulrich Furbach and Natarajan Shankar}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {112-124}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4130}, DOI = {10.1007/11814771_10} } @INPROCEEDINGS{DBLP:conf/icsr/SemmakB06, AUTHOR = {Farida Semmak and Joël Brunet}, BOOKTITLE = {Reuse of Off-the-Shelf Components, 9th International Conference on Software Reuse, ICSR 2006, Turin, Italy, June 12-15, 2006, Proceedings}, TITLE = {Variability in Goal-Oriented Domain Requirements}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Maurizio Morisio}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {390-394}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4039}, DOI = {10.1007/11763864_30} } @INPROCEEDINGS{jfla06, AUTHOR = {Antoine Spicher and Olivier Michel}, BOOKTITLE = {Journées Francophones des Langages Applicatifs}, TITLE = {Stratégie d'application stochastique de règles de réécritures dans le langage MGS}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {INRIA}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2006/jfla06.pdf} } @INPROCEEDINGS{DPY, AUTHOR = { T.Dayar and N. Pekergin and S. Younès}, BOOKTITLE = {SMCtools '06: Proceeding from the 2006 workshop on Tools for solving structured Markov chains}, TITLE = {Conditional steady-state bounds for a subset of states in Markov chains}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {3}, PUBLISHER = {ACM Press}, OPTSERIES = {}, VOLUME = {21}, URL = {http://doi.acm.org/10.1145/1190366.1190369} } @INPROCEEDINGS{DBLP:conf/formats/Vasilyev06, AUTHOR = {Pavel Vasilyev}, BOOKTITLE = {Formal Modeling and Analysis of Timed Systems, 4th International Conference, FORMATS 2006, Paris, France, September 25-27, 2006, Proceedings}, TITLE = {Simulator for Real-Time Abstract State Machines}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Eugene Asarin and Patricia Bouyer}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {337-351}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4202}, DOI = {10.1007/11867340_24} } @INPROCEEDINGS{DBLP:conf/vveis/Vasilyev06, AUTHOR = {Pavel Vasilyev}, BOOKTITLE = {Modelling, Simulation, Verification and Validation of Enterprise Information Systems, Proceedings of the 4th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems, MSVVEIS 2006, In conjunction with ICEIS 2006, Paphos, Cyprus, May 2006}, TITLE = {Simulator for Real-Time Abstract State Machines}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Joseph Barjis and Ulrich Ultes-Nitsche and Juan Carlos Augusto}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {202-205}, PUBLISHER = {INSTICC Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Verlan06c, AUTHOR = {Sergey Verlan and Francesco Bernardini and Marian Gheorghe and Maurice Margenstern}, BOOKTITLE = {Membrane Computing, 7th International Workshop, WMC 2006, Leiden, The Netherlands, July 17-21, 2006, Revised, Selected, and Invited Papers}, TITLE = {Computational Completeness of Tissue P Systems with Conditional Uniport}, YEAR = {2006}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Hendrik Jan Hoogeboom and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {521-535}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4361}, DOI = {10.1007/11963516_33} } @TECHREPORT{TR-LACL-2006-03, AUTHOR = {Catalin Dima}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Dynamical properties of timed automata revisited}, YEAR = {2006}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2006-03}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2006-03.pdf} } @TECHREPORT{TR-LACL-2006-02, AUTHOR = {Catalin Dima and C. Enea and R. Gramatovici}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A Synchronous Model for Information Flow}, YEAR = {2006}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2006-02}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2006-02.pdf} } @TECHREPORT{TR-LACL-2006-01, AUTHOR = {Catalim Dima and Contantin Enea and Radu Gramatovici}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Nondeterministic nointerference and deducible information flow}, YEAR = {2006}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2006-01}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2006-01.pdf} } @TECHREPORT{TR-LACL-2006-5, AUTHOR = {Emmanuel Polonowski}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Deriving SN from PSN: a general proof technique}, YEAR = {2006}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2006-5}, OPTTYPE = {}, URL = {http://hal.archives-ouvertes.fr/hal-00420464/en/}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-LACL-2006-5.pdf} } @MISC{tsi2006, AUTHOR = {G. Hains}, HOWPUBLISHED = {Technique et Science Informatiques}, MONTH = {July}, NOTE = {Chronique}, TITLE = {L'Agence Nationale de la Recherche et le Financement de la recherche en STIC}, YEAR = {2006}, NUMBER = {4}, PAGES = {553--564}, PUBLISHER = {Hermes -- Lavoisier}, VOLUME = {25} } @PROCEEDINGS{MiVaYu:2005:bfca, TITLE = {BFCA'05 - Boolean Functions: Cryptography and Applications}, YEAR = {2005}, OPTADDRESS = {}, EDITOR = {Jean-Francis Michon and Pierre Valarcher and Jean-Baptiste Yunès}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PUBLISHER = {Presse Universitaire de Rouen et du Havre}, OPTSERIES = {}, OPTVOLUME = {}, PAGES = {200} } @PROCEEDINGS{Cegielski:2005:ENTCS, TITLE = {11th Workshop on Logic, Language, Information and Computation (WoLLIC 04)}, YEAR = {2005}, OPTADDRESS = {}, EDITOR = {de Queiroz, Ruy and Patrick Cégielski}, OPTMONTH = {}, NOTE = {1-3}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPUBLISHER = {}, SERIES = {Electronic Notes on Theoretical Computer Science}, VOLUME = {123} } @PHDTHESIS{GAVA2005:THESIS, AUTHOR = {Frédéric Gava}, SCHOOL = {University Paris XII-Val de Marne, LACL}, TITLE = {Approches fonctionnelles de la programmation parallèle et des méta-ordinateurs. Sémantiques, implantations et certification}, YEAR = {2005}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/gava/papers/these_gava.pdf} } @INBOOK{michel05a, PUBLISHER = {Springer Verlag}, TITLE = {An Analysis of a Public-Key Protocol with Membranes}, YEAR = {2005}, AUTHOR = {Olivier Michel and F. Jacquemard}, ALTCHAPTER = {}, EDITOR = {G. Ciobanu and P aun, G. and . J. Pérez-Jiménez}, PAGES = {283--302}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, SERIES = {Natural Computing Series}, OPTTYPE = {}, OPTVOLUME = {}, ANNOTE = {(442 + viii pages)}, BOOKTITLE = {Applications of Membrane Computing}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2005/nspk-05.pdf}, ABSTRACT = { In this paper, we develop an analysis of the Needham-Schroeder Public-Key Protocol in the framework of membrane computing. This analysis is used to validate the protocol and exhibits, as expected, a well known logical attack. The novelty of our approach is to use multiset rewriting in a nest of membranes. The use of membranes enables to tight the conditions for detecting an attack. The approach has been validated by developing a full implementation for several versions of the analysis.} } @INCOLLECTION{Dima:2005:vissas, AUTHOR = {Catalin Dima}, BOOKTITLE = {Proceedings of the NATO Advanced Research Workshop on Verification of Infinite State Systems with Applications to Security (VISSAS'05)}, PUBLISHER = {IOS Press}, TITLE = {A class of automata for computing reachability relations in timed systems}, YEAR = {2005}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {E. Clarke and F. L. Tiplea}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {69--90}, SERIES = {NATO ARW Series}, OPTTYPE = {}, OPTVOLUME = {} } @ARTICLE{FrFrLa:2005:SSM, AUTHOR = {Fraikin B. and Marc Frappier and Régine Laleau}, JOURNAL = {Software and Systems Modeling}, TITLE = {State-based versus event-based specifications for information systems: a comparison of B and EB$^{3}$}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {236-257}, VOLUME = {4}, PUBLISHER = {Springer}, URL = {http://hal.archives-ouvertes.fr/hal-00145961/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/14/59/61/PDF/SoSym05FraikinFrappierLaleau.pdf} } @ARTICLE{IGMA_coiBlaCerFor05, AUTHOR = {François Blanchard and Julien Cervelle and Enrico Formenti}, JOURNAL = {Theoretical Computer Science}, TITLE = {Some results about the chaotic behavior of cellular automata}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {318--336}, VOLUME = {349} } @ARTICLE{DBLP:journals/dam/CaspardM05, AUTHOR = {Nathalie Caspard and Bernard Monjardet}, JOURNAL = {Discrete Applied Mathematics}, TITLE = {Erratum to: The lattice of closure systems, closure operators and implicational systems on a finite set: a survey: [Discrete Applied Mathematics 127(2) (2003) 241-269]}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {333}, VOLUME = {145}, DOI = {10.1016/j.dam.2004.08.001} } @ARTICLE{Cegielski:2005:JMS, AUTHOR = {Patrick Cégielski}, JOURNAL = {J. of Mathematical Sciences}, TITLE = {Decidability and p-destinies}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {4620-4623}, VOLUME = {130}, PUBLISHER = {Springer} } @ARTICLE{DuflotFHLMMPP05, AUTHOR = {M. Duflot and L. Fribourg and T. Hérault and R. Lassaigne and F. Magniette and S. Messika and S.Peyronnet and C. Picaronny}, JOURNAL = {Electr. Notes Theor. Comput. Sci.}, TITLE = {Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {6}, PAGES = {195--214}, VOLUME = {128} } @ARTICLE{DBLP:journals/corr/abs-cs-0507020, AUTHOR = {Arnaud Durand and Etienne Grandjean}, JOURNAL = {CoRR}, TITLE = {First-order queries on structures of bounded degree are computable with constant delay}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTPAGES = {}, VOLUME = {abs/cs/0507020}, URL = {http://arxiv.org/abs/cs/0507020} } @ARTICLE{DBLP:journals/tcs/DurandHK05, AUTHOR = {Arnaud Durand and Miki Hermann and Phokion G. Kolaitis}, JOURNAL = {Theor. Comput. Sci.}, TITLE = {Subtractive reductions and complete problems for counting complexity classes}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {496-513}, VOLUME = {340}, URL = {http://hal.inria.fr/inria-00099381/en/}, DOI = {10.1016/j.tcs.2005.03.012} } @ARTICLE{GAVA2005:SCPE, AUTHOR = {Frédéric Gava}, JOURNAL = {Scalable Computing: Practice and Experience}, TITLE = {External Memory in Bulk Synchronous Parallel ML}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {43--70}, VOLUME = {6}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_scpe_2005.pdf} } @ARTICLE{GL2005:PPL, AUTHOR = {Frédéric Gava and Frédéric Loulergue}, JOURNAL = {Parallel Processing Letters}, TITLE = {A Functional Language for Departmental Metacomputing}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {289--304}, VOLUME = {15}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_loulergue_ppl_2005.pdf}, DOI = {10.1142/S0129626405002222} } @ARTICLE{GL2004:FGCS, AUTHOR = {Frédéric Gava and Frédéric Loulergue}, JOURNAL = {Future Generation Computer Systems}, TITLE = {A Static Analysis for Bulk Synchronous Parallel ML to Avoid Parallel Nesting}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {5}, PAGES = {665--671}, VOLUME = {21}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_loulergue_fgcs_2004.pdf}, DOI = {10.1016/j.future.2004.05.006} } @ARTICLE{Verlan05d, AUTHOR = {Maurice Margenstern and Gheorghe Paun and Yurii Rogozhin and Sergey Verlan}, JOURNAL = {Theoretical Computer Science}, TITLE = {Context-free insertion-deletion systems}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {339-348}, VOLUME = {330}, DOI = {10.1016/j.tcs.2004.06.031} } @ARTICLE{Verlan05c, AUTHOR = {Maurice Margenstern and Yurii Rogozhin and Sergey Verlan}, JOURNAL = {Fundamenta Informaticae}, TITLE = {Time-Varying Distributed H Systems: An Overview}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1-4}, PAGES = {291-306}, VOLUME = {64}, URL = {http://iospress.metapress.com/openurl.asp?genre=article&issn=0169-2968&volume=64&issue=1&spage=291} } @ARTICLE{PDA05, AUTHOR = {Nihal Pekergin and Tugrul Dayar and Denizhan N. Alparslan}, JOURNAL = {European Journal of Operational Research}, TITLE = {Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {810--825}, VOLUME = {165}, PUBLISHER = {Elsevier} } @ARTICLE{SCPE05, AUTHOR = {Franck Pommereau}, JOURNAL = {Scalable Computing: Practice and Experience}, TITLE = {Petri nets as executable specifications of high-level timed parallel systems.}, YEAR = {2005}, MONTH = {December}, OPTNOTE = {}, NUMBER = {6}, PAGES = {71-82}, VOLUME = {6}, KEYWORDS = {Petri nets, parallelism, real-time, execution machines.}, PUBLISHER = {SWPS}, URL = {http://hal.archives-ouvertes.fr/hal-00114670/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/11/46/70/PDF/2005-scpe.pdf}, ABSTRACT = {We propose to use high-level Petri nets as a model for the semantics of high-level parallel systems. This model is known to be useful for the purpose of verification and we show that it is also executable in a parallel way. Executing a Petri net is not difficult in general but more complicated in a timed context, which makes necessary to synchronise the internal time of the Petri net with the real time of its environment. Another problem is to relate the execution of a Petri net, which has its own semantics, to that of its environment; ie, to properly handle input/output. This paper presents a parallel algorithm to execute Petri nets with time, enforcing the even progression of internal time with respect to that of the real time and allowing the exchange of information with the environment. We define a class of Petri nets suitable for a parallel execution machine which preserves the step sequence semantics of the nets and ensures time consistent executions while taking into account the solicitation of its environment. The question of the efficient verification of such nets has been addressed in a separate paper, the present one is more focused on the practical aspects involved in the execution of so modelled systems.} } @ARTICLE{Verlan05a, AUTHOR = {Sergey Verlan}, JOURNAL = {Theoretical Computer Science}, TITLE = {A Boundary Result on Enhanced Time-Varying Distributed H Systems with Parallel Computations}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2-3}, PAGES = {226--242}, VOLUME = {344}, PUBLISHER = {Elsevier Science Publishers Ltd.}, DOI = {10.1016/j.tcs.2005.03.056} } @ARTICLE{Verlan05b, AUTHOR = {Sergey Verlan and Maurice Margenstern}, JOURNAL = {Fundamenta Informaticae}, TITLE = {About Splicing P Systems with One Membrane}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {279-290}, VOLUME = {65}, URL = {http://iospress.metapress.com/openurl.asp?genre=article&issn=0169-2968&volume=65&issue=3&spage=279} } @ARTICLE{YUNES:2005:HAL-00081326:1, AUTHOR = {Jean-Baptiste Yunès and Jean-Francis Michon and Pierre Valarcher}, JOURNAL = {RAIRO - Theoretical Informatics and Applications}, TITLE = {On Maximal QROBDD's of Boolean Functions}, YEAR = {2005}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {04--42}, VOLUME = {39}, KEYWORDS = {Boolean Functions, Complexity, Binary Decision Diagram}, URL = {http://hal.archives-ouvertes.fr/hal-00081326/en/}, ABSTRACT = {{W}e investigate the structure of ``worst-case'' quasi reduced ordered decision diagrams and {B}oolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. {W}e, then, introduce a notion of complexity which leads to the concept of ``hard'' {B}oolean functions as functions whose {QROBDD} are ``worst-case'' ones. {S}o we exhibit the relation between hard functions and the {S}torage {A}ccess function (also known as {M}ultiplexer).} } @INPROCEEDINGS{Verlan05g, AUTHOR = {Artiom Alhazov and Maurice Margenstern and Vladimir Rogozhin and Yurii Rogozhin and Sergey Verlan}, BOOKTITLE = {International Workshop WMC5, Milano, Italy}, TITLE = {Communicative P Systems with Minimal Cooperation}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Giancarlo Mauri and P aun, Gheorghe and Mario J. Pérez-Jiménez and Grzegorz Rozenberg and Arto Salomaa}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {161-177}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {3365}, URL = {http://www.springerlink.com/content/r277h411ut40rl27}, DOI = {10.1007/b106721} } @INPROCEEDINGS{sefm05, AUTHOR = {S. Anantharaman and J. Chen and G. Hains}, BOOKTITLE = {SEFM'05, The 3rd IEEE Int. Conference on Software Engineering and Formal Methods}, TITLE = {A Synchronous Process Calculus for Service Costs}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {435--444}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{ANDARY:2005:HAL-00083380:1, AUTHOR = {Philippe Andary and Bruno Patrou and Pierre Valarcher}, BOOKTITLE = {International Workshop on Abstract State Machine}, TITLE = {About implementation of primitive recursive algorithms}, YEAR = {2005}, ADDRESS = {Paris France}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00083380/en/} } @INPROCEEDINGS{iccs-paap05, AUTHOR = {M. Bamha and G. Hains}, BOOKTITLE = {Workshop on Practical Aspects of High-Level Parallel Programming (PAPP), ICCS Conference}, TITLE = {An Efficient Equi-semi-join Algorithm for Distributed Architectures}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {April}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer-Verlag}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {3515}, URL = {http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/11428848_97} } @INPROCEEDINGS{BeDuMi:2005:VISSAS, AUTHOR = {Danièle Beauquier and Marie Duflot and M. Minea}, BOOKTITLE = {Third International Workshop Mathematical Methods, Models and Architectures for Computer Networks Security}, TITLE = {A Probabilistic Property-Specific Approach to Information Flow}, YEAR = {2005}, ADDRESS = {Timisoara (Roumanie)}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {September}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {206-220}, OPTPUBLISHER = {}, SERIES = {LNCS}, VOLUME = {3685}, URL = {http://hal.archives-ouvertes.fr/hal-00091587/en/}, DOI = {10.1007/11560326_16} } @INPROCEEDINGS{DBLP:conf/aiccsa/Ben-OthmanCM05, AUTHOR = {Jalel Ben-Othman and Hind Castel-Taleb and Lynda Mokdad}, BOOKTITLE = {2005 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2005)}, TITLE = {Multi-services MAC protocol for wireless networks}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {61}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/AICCSA.2005.1387055} } @INPROCEEDINGS{Verlan05j, AUTHOR = {Francesco Bernardini and Francisco J. Romero-Campero and Marian Gheorghe and Mario J. Perez-Jimenez and Maurice Margenstern and Sergey Verlan and Natalio Krasnogor}, BOOKTITLE = {SYNASC '05: Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing}, TITLE = {On P Systems with Bounded Parallelism}, YEAR = {2005}, ADDRESS = {Washington, DC, USA}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {399-406}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/SYNASC.2005.51} } @INPROCEEDINGS{ESM2005, AUTHOR = {M. Bernichi and F. Mourlin}, BOOKTITLE = {The 2005 European Simulation and Modelling Conference}, TITLE = {A new behavioural pattern for mobile code.}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {In F. Teixeira and C. Brito}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {435--439}, PUBLISHER = {EUROSIS}, OPTSERIES = {}, OPTVOLUME = {}, ABSTRACT = {Nowadays, mobility in data processing has started being approached and applied in several domains: collect of information, system administration, and intrusion detection system… Nonetheless, the implementation of mobile features has to be robust, simple, secure and easily understandable. Therefore, in our research -- based on the autonomous and mobile agent as well as the intrusion detection system -- we decided, in the first place, to build a mobile agent pattern in order to provide a clean and easy way to develop an agent based application; mainly in an open and on a large scale distributed environment, such as Internet and application areas and E-commerce, as well. In our study, we chose Java Technology for the implementation because it is more suitable, secure OS independent for the development of such kind of code; it contains also a security manager mechanism that is customizable by a host accepting a mobile agent. Thus, any attack or evasion method will not perturb the behaviour of the host. In short, the host will be safer. Besides, we used JINI (Java Intelligent Network Interface) as a usable API dedicated to a user protocol.} } @INPROCEEDINGS{EUROCON05, AUTHOR = {M. Bernichi and F. Mourlin}, BOOKTITLE = {The international Conference on Computer as tools}, TITLE = {Java mobile agents for monitoring mobile activities.}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {L. Milic}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {52- 55}, PUBLISHER = {IEEE}, OPTSERIES = {}, VOLUME = {1}, ABSTRACT = {Mobile Agent provides a way to think about solving software problems in a networked environment that fits more naturally with the real world. Mobile Agent technology can make distributed systems more adaptable to application needs especially in mobile environment. The use of mobile code makes distributed supervisor systems and the abstractions they provide more flexible to build and use. This paper explains how mobile agent meets the requirement of monitoring activities deployed over J2ME platforms. The architecture of such application is presented and the monitoring of activities, based on the Jini framework and some mobile patterns.} } @INPROCEEDINGS{crisis2005, AUTHOR = {M. Blanc and P. Courtieu and G. Hains}, BOOKTITLE = {First Colloquium on Risk and Security of the Internet and Systems (CRiSIS 2005)}, TITLE = {Mandatory Access Control on Distributed Systems: A Metapolicy Framework.}, YEAR = {2005}, ADDRESS = {ENSI-Bourges, France}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {133--144}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/dlt/BesC05, AUTHOR = {Alexis Bès and Olivier Carton}, BOOKTITLE = {Developments in Language Theory}, TITLE = {A Kleene Theorem for Languages of Words Indexed by Linear Orderings}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {de Felice, Clelia and Antonio Restivo}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {158-167}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {3572}, DOI = {10.1007/11505877_14} } @INPROCEEDINGS{iscis05, AUTHOR = {H. Castel-Taleb and J.-M. Fourneau and N. Pekergin}, BOOKTITLE = {International Symposium on Computer and Informational Sciences, ISCIS 2005}, TITLE = {Stochastic Bounds on Partial Ordering: Application to Memory Overflows Due to Bursty Arrivals}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Pinar Yolum and Tunga Güngör and Fikret S. Gürgen and Can C. Özturan }, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {244--253}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {3733}, DOI = {10.1007/11569596_27} } @INPROCEEDINGS{DBLP:conf/mascots/Castel-TalebM05, AUTHOR = {Hind Castel-Taleb and Lynda Mokdad}, BOOKTITLE = {13th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2005)}, TITLE = {Performance measure bounds in mobile networks by state space reduction}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {397--406}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/MASCOT.2005.53} } @INPROCEEDINGS{IGMA_CerForMas05, AUTHOR = {Julien Cervelle and Enrico Formenti and Benoît Masson}, BOOKTITLE = {30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05)}, TITLE = {Basic Properties for Sand Automata.}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Joanna Jedrzejowicz and Andrzej Szepietowski}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {192--211}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {3618} } @INPROCEEDINGS{CohSliss:2005:IRRTASMD, AUTHOR = {Joëlle Cohen and Anatol Slissenko}, BOOKTITLE = {Proc. of the 6th Intern. Conf. on Computer Science and Information Technology (CSIT'2005),September 19--23, 2005, Yerevan, Armenia. Organized by National Academy of Science of Armenia in cooperation with Test Technology Technical Council of IEEE Computer Society}, TITLE = {Implementation of reactive real-time abstract state machines by machines with delayed actions}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {48-53}, PUBLISHER = {National Academy of Science of Armenia}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{CohSliss:2005:IIATASMD, AUTHOR = {Joëlle Cohen and Anatol Slissenko}, BOOKTITLE = {Proc. of the 12th Intern. Workshop on Abstract State Machines (ASM'2005), March 8-11, 2005, Paris, France.}, TITLE = {On implementations of instantaneous actions real-time ASM by ASM with delays}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {387-396}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{CrLaVa:2005:nwpt, AUTHOR = {Tristan Crolard and Samuel Lacas and Pierre Valarcher}, BOOKTITLE = {17th Nordic Workshop on Programming Theory}, TITLE = {On the expressive power of the Loop language}, YEAR = {2005}, ADDRESS = {Danemark Copenhaguen}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.ccsd.cnrs.fr/ccsd-00083374/en/} } @INPROCEEDINGS{Cegielski:2005:CSIT, AUTHOR = {Patrick Cégielski and Irène Guessarian and Yuri Matiyasevich}, BOOKTITLE = {CSIT'2005 ( Computer Science and Information Technologies, September 19--23, 2005, Yerevan, Armenia), The National Academy of Sciences of Armenia Publishers}, TITLE = {Multiple serial episodes matching}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {26-38}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Cegielski:2005:CSIT2, AUTHOR = {Patrick Cégielski and Denis Richard and Maxim Vsemirnov}, BOOKTITLE = {CSIT'2005 ( Computer Science and Information Technologies, September 19--23, 2005, Yerevan, Armenia), The National Academy of Sciences of Armenia Publishers}, TITLE = {On the additive theory of prime numbers II}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {39-47}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Dima:2005:concur, AUTHOR = {Catalin Dima}, BOOKTITLE = {Proceedings of 16th International Conference on Concurrency Theory (CONCUR'05)}, TITLE = {Timed shuffle expressions}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {95--109}, OPTPUBLISHER = {}, SERIES = {LNCS}, VOLUME = {3653} } @INPROCEEDINGS{DFH+04, AUTHOR = {Marie Duflot and Laurent Fribourg and Hérault Thomas and Richard Lassaigne and Frédéric Magniette and Stéphane Messika and Sylvain Peyronnet and Claudine Picaronny}, BOOKTITLE = {Proc. 4th Int. Workshop on Automated Verification of Critical Systems (AVoCS'04)}, TITLE = {Probabilistic model checking of the CSMA/CD protocol using PRISM and APMC}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {6}, OPTORGANIZATION = {}, PAGES = {195--214}, OPTPUBLISHER = {}, SERIES = {ENTCS}, VOLUME = {128} } @INPROCEEDINGS{DBLP:conf/ifip1-7/Enea05, AUTHOR = {Constantin Enea}, BOOKTITLE = {Formal Aspects in Security and Trust, Third International Workshop, FAST 2005, Newcastle upon Tyne, UK, July 18-19, 2005, Revised Selected Papers}, TITLE = {Unifying Decidability Results on Protection Systems Using Simulations}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Theodosis Dimitrakos and Fabio Martinelli and Peter Y. A. Ryan and Steve A. Schneider}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {96-111}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {3866}, DOI = {10.1007/11679219_8} } @INPROCEEDINGS{Zakopane, AUTHOR = {Jean-Michel Fourneau and Nihal Pekergin}, BOOKTITLE = {EuroNGI Workshop on New Trends in modelling, quantitative methods and measurements}, TITLE = {Brief introduction to an algorithmic approach for strong stochastic bounds}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{saintsana, AUTHOR = {J.M. Fourneau and N. Pekergin and S. Younès}, BOOKTITLE = {SAINT-W '05: Proceedings of the 2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)}, TITLE = {Improving stochastic model checking with stochatic bounds}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {M. Papazoglu and K. Yamazaki}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {260-263}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{GeFrLa:2005:SEFM, AUTHOR = {Frédéric Gervais and Marc Frappier and Régine Laleau}, BOOKTITLE = {SEFM 2005 - 3rd IEEE International Conference on Software Engineering and Formal Methods}, TITLE = {Generating relational database transactions from recursive functions defined on EB$^{3}$ traces}, YEAR = {2005}, ADDRESS = {Koblenz, Germany}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {7-9 September}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {117--126}, PUBLISHER = {IEEE Computer Society Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{GeFrLa:2005:MSVVEIS, AUTHOR = {Frédéric Gervais and Marc Frappier and Régine Laleau}, BOOKTITLE = {MSVVEIS 2005 - 3rd International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems}, TITLE = {How to synthesize relational database transactions from EB$^{3}$ attribute definitions?}, YEAR = {2005}, ADDRESS = {Miami, USA}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {24-25 May}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {83--88}, PUBLISHER = {INSTICC Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{GeFrLa:2005:IFM, AUTHOR = {Frédéric Gervais and Marc Frappier and Régine Laleau}, BOOKTITLE = {Integrated Formal Methods, 5th International Conference, IFM 2005, Eindhoven, The Netherlands, November 29 - December 2, 2005, Proceedings}, TITLE = {Synthesizing B Specifications from EB3 Attribute Definitions}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Judi Romijn and Graeme Smith and van de Pol, Jaco}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {207-226}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {3771} } @INPROCEEDINGS{giavitto05z, AUTHOR = {Jean-Louis Giavitto and Olivier Michel and Julien Cohenn and Antoine Spicher}, BOOKTITLE = {Unconventional Programming Paradigms (UPP'04)}, TITLE = {Computation in Space and Space in Computation}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {J.-P Banâtre and P. Fradet and Jean-Louis Giavitto and Olivier Michel}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, ORGANIZATION = {ERCIM-- NSF}, PAGES = {137-152}, PUBLISHER = {Springer Verlag}, SERIES = {LNCS}, VOLUME = {3566}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2005/upp04-version-finale-lncs.pdf} } @INPROCEEDINGS{LaViLe:2005:SREP, AUTHOR = {Régine Laleau and S. Vignes and Y. Ledru and M. Lemoine and D. Bert and V. DonzeauGouge and C. Dubois and F. Peureux}, BOOKTITLE = {SREP'05 - Proceedings of the First International Workshop on Situational Requirements Engineering Processes: Methods, Techniques and Tools to Support Situation-Specific Requirements Engineering Processes. Organized by IFIP WG8.1 Method Engineering Task Group, In conjunction with the 13th IEEE International Requirements Engineering Conference}, TITLE = {Application of Requirements Analysis Techniques to the analysis of civil aviation security standards}, YEAR = {2005}, ADDRESS = {Paris, France}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {29-30 August}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {91--106}, PUBLISHER = {University of Limerick, Ireland}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{LOU2005:SNPD, AUTHOR = {F. Loulergue}, BOOKTITLE = {6th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD2005)}, TITLE = {Optimizing Bulk Synchronous Parallel ML}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Chao Lu and Roger Lee}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {294-299}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{LGB2005:ICCS, AUTHOR = {Frédéric Loulergue and Frédéric Gava and Dadid Billiet}, BOOKTITLE = {International Conference on Computational Science (ICCS 2005), Part II}, TITLE = {Bulk Synchronous Parallel ML: Modular Implementation and Performance Prediction}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {V. S. Sunderam and van Albada, G. Dick and P. M. A. Sloot and J. Dongarra}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1046--1054}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {3515}, PDF = {http://lacl.univ-paris12.fr/gava/papers/loulergue_gava_billiet_iccs_2005.pdf}, DOI = {10.1007/11428848_132} } @INPROCEEDINGS{BP05, AUTHOR = {M. Ben Mamoun and N. Pekergin}, BOOKTITLE = {SAINT-W '05: Proceedings of the 2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)}, TITLE = {Computing closed-form stochastic bounds on transient distributions of Markov chains}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {M. Papazoglu and K. Yamazaki}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {260-263}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{giavitto05e, AUTHOR = {Olivier Michel and Jean-Pierre Banâtre and Pascal Fradet and Jean-Louis Giavitto}, BOOKTITLE = {The Grand Challenge in Non-Classical Computation}, TITLE = {Challenging Questions for the Rationals of Non-Classical Programming Languages}, YEAR = {2005}, ADDRESS = {The King's Manor, York, United Kingdom}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {18-19 April}, NOTE = {(an extended version will be published in the Journal of Unconventional Computing)}, OPTNUMBER = {}, ORGANIZATION = {University of York and Microsoft Research}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2005/gc2005.pdf} } @INPROCEEDINGS{epew5, AUTHOR = {N. Pekergin and S. Younès}, BOOKTITLE = {EPEW/WS-FM2005}, TITLE = {Stochastic Model Checking with Stochastic Comparison}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Mario Bravetti and Leïla Kloul and Gianluigi Zavattaro}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {109-124}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {3670}, DOI = {10.1007/11549970_9} } @INPROCEEDINGS{pelz05:_model_multis_inter_networ_arbit, AUTHOR = {E. Pelz and D. Tutsch}, BOOKTITLE = {ESM'05 Conf., part: Simulation with Petri nets}, TITLE = {Modeling Multistage Interconnection Networks of Arbitrary Crossbar Size with Compositional High Level Petri Nets}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {537-543}, PUBLISHER = {Eurosis Publication}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Verlan05e, AUTHOR = {Yurii Rogozhin and Sergey Verlan}, BOOKTITLE = {Membrane Computing, 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers}, TITLE = {On the Rule Complexity of Universal Tissue P Systems}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Rudolf Freund and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {356-362}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {3850}, DOI = {10.1007/11603047_24} } @INPROCEEDINGS{Sliss:2005:VPLTAQ, AUTHOR = {Anatol Slissenko}, BOOKTITLE = {Proc of the 14th Annual Conference (and 19th International Workshop) on Computer Science Logic (CSL 2005), Oxford, UK, 22-25 August 2005, Lect. Notes in Comput. Sci, vol. 3634}, TITLE = {Verification in Predicate Logic with Time: Algorithmic Questions}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Luke Ong}, OPTMONTH = {}, NOTE = {(Invited talk.)}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {3--17}, PUBLISHER = {Springer-Verlag}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{ipcat05, AUTHOR = {Antoine Spicher and Olivier Michel}, BOOKTITLE = {Sixth International Workshop on Information Processing in Cells and Tissues}, TITLE = {Declarative modeling of a neurulation-like process}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2005/ipcat05_spicher_michel_CRV.pdf}, ABSTRACT = { MGS is an experimental programming language dedicated to the modeling and the simulation of a special kind of discrete dynamical systems. \emph{Dynamical systems with a dynamical structure} (or DS$^2$) arise when the state space is not fixed \emph{a priori} but is jointly computed with the current state during the simulation. In this case the evolution function is often given through local rules that drive the interaction between some system components. MGS offers a new kind of data structure, \emph{topological collections}, to describe the state of a dynamical system, and \emph{transformations} to express local and discrete evolution laws. These two notions permit an easy specification of DS$^2$. We propose in this paper a presentation of the MGS language and its main contributions. We show that various topological collections can be unified using concepts developped in combinatorial algebraic topology: \emph{cellular complexes} and \emph{topological chains}. Then we apply the notions brought by MGS to model and simulate the first step towards the simulation of the neurulation process where a sheet of cell evolves to a neural tube. It is a direct description of the modification of the topology of an arbitrary structure expressed in terms of local discrete evolution laws.} } @INPROCEEDINGS{iccs05, AUTHOR = {Antoine Spicher and Olivier Michel}, BOOKTITLE = {Fifth International Conference on Computational Science (ICCS'05)}, TITLE = {Using Rewriting Techniques in the Simulation of Dynamical Systems: Application to the Modeling of Sperm Crawling}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {LNCS 3514}, OPTORGANIZATION = {}, PAGES = {820--827}, OPTPUBLISHER = {}, OPTSERIES = {}, VOLUME = {I}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2005/iccs.pdf}, ABSTRACT = { Rewriting system (RS) are a formalism widely used in computer science. However, such a formalism can also be used to specify executable models of dynamical systems (DS) by allowing the specification of the evolution laws of the systems in a local manner. The main drawback of RS is that they are well understood and well known only for terms (a tree-like structure) and that their expressivity is not enough for the representation of complex organizations that can be found in DS. We propose a framework based on topological notion to extend the notion of RS on more sophisticated structures; the corresponding concepts are validated through the development of an experimental programming language, MGS, dedicated to the simulation of DS. We show how the MGS rewriting system can be used to specify complex dynamical systems and illustrate it with the simulation of the motility of the nematode's sperm cell. } } @INPROCEEDINGS{ea05, AUTHOR = {Antoine Spicher and Olivier Michel and Jean-Louis Giavitto}, BOOKTITLE = {7th International Conference on Artificial Evolution}, TITLE = {Algorithmic self-assembly by accretion and by carving in MGS}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {189-200}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2005/ea05.pdf}, ABSTRACT = { We report the use of MGS, a declarative and rule-based language, for the modeling of various self-assembly processes. The approach is illustrated on the fabrication of a fractal pattern, a Sierpinsky triangle, using two approaches: by \emph{accretive growth} and by \emph{carving}. The notion of topological collections available in MGS enables the easy and concise modeling of self-assembly processes on various lattice geometries as well as more arbitrary constructions of multi-dimensional objects.} } @INPROCEEDINGS{VALARCHER:2005:HAL-00083376:1, AUTHOR = {Pierre Valarcher}, BOOKTITLE = {5th International Workshop on Reduction Strategies in Rewriting and Programming}, TITLE = {Call-by-name vs call-by-value in primitive recursion : storage operator}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00083376/en/} } @INPROCEEDINGS{Verlan05f, AUTHOR = {Sergey Verlan}, BOOKTITLE = {Seventh International Workshop on Descriptional Complexity of Formal Systems, June 30 -- July 2, 2005 Como, Italy. Proceedings.}, TITLE = {On Minimal Context-Free Insertion-Deletion Systems}, YEAR = {2005}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {C. Mereghetti and B. Palano and G. Pighizzini and D. Wotschke}, OPTMONTH = {}, NOTE = {Technical repport no. 06-05, University of Milan}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {285-292}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @TECHREPORT{TR-LACL-2005-02, AUTHOR = {D. Beauquier and M. Duflot and M. Minea}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A Probabilistic Property-Specific Approach to Information Flow}, YEAR = {2005}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2005-02}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2005-02.pdf} } @TECHREPORT{TR-LACL-2005-03, AUTHOR = {Joëlle Cohen and A. Slissenko}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {In Implementations of Instantaneous Actions Real-Time ASM by ASM with Delays}, YEAR = {2005}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2005-03}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2005-03.pdf} } @TECHREPORT{TR-LACL-2005-01, AUTHOR = {F. Gava and F Loulergue}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Semantics and Implementation of the Parallel Superposition for Bulk-Synchronous Parallel ML}, YEAR = {2005}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2005-01}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2005-01.pdf} } @TECHREPORT{GeFrLa:2005:RT829, AUTHOR = {Frédéric Gervais and Marc Frappier and Régine Laleau}, INSTITUTION = {CEDRIC}, TITLE = {Vous avez dit raffinement ?}, YEAR = {2005}, ADDRESS = {Paris, France}, MONTH = {March}, OPTNOTE = {}, NUMBER = {829}, OPTTYPE = {} } @TECHREPORT{GeFrLa:2005:RT700, AUTHOR = {Frédéric Gervais and Marc Frappier and Régine Laleau and P. Batanado}, INSTITUTION = {CEDRIC}, TITLE = {EB$^{3}$ Attribute Definitions: Formal Language and Application}, YEAR = {2005}, ADDRESS = {Paris, France}, MONTH = {February}, OPTNOTE = {}, NUMBER = {700}, OPTTYPE = {} } @TECHREPORT{TR-LACL-2005-05, AUTHOR = {R. Lanotte and D. Beauquier}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A Decidable Probability Logic for Timed and Untimed Probabilistic Systems}, YEAR = {2005}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2005-05}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2005-05.pdf} } @TECHREPORT{TR-LACL-2005-04, AUTHOR = {A. Verchinine}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Dynamic Loading and Type Safety with Java 2}, YEAR = {2005}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2005-04}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2005-04.pdf} } @BOOK{Cegielski:2004:eyrolles, PUBLISHER = {Eyrolles}, TITLE = {Conception des systèmes d'exploitation : Le cas linux, seconde édition}, YEAR = {2004}, AUTHOR = {Patrick Cégielski}, ALTEDITOR = {}, OPTADDRESS = {}, OPTEDITION = {}, OPTMONTH = {}, NOTE = {680 p}, OPTNUMBER = {}, OPTSERIES = {}, OPTVOLUME = {} } @PROCEEDINGS{giavitto05b, TITLE = {Proceedings of EU-NSF Strategic Research Workshop on the Unconventional Programming Paradigms (UPP'04)}, YEAR = {2004}, ADDRESS = {Mont Saint-Michel, France}, EDITOR = {J.-P Banâtre and P. Fradet and Jean-Louis Giavitto and Olivier Michel}, MONTH = {September}, NOTE = {Revised, selected and invited papers. 367 p. ISBN: 3-540-27884-2. rlhttp://www.springeronline.com/3-540-27884-2}, OPTNUMBER = {}, ORGANIZATION = {ERCIM -- NSF}, PUBLISHER = {Springer Verlag}, SERIES = {LNCS}, VOLUME = {3566}, URL = {http://www.springer.com/france/home/generic/search/results?SGWID=7-40109-22-56489535-0} } @PROCEEDINGS{EURONGI, TITLE = {Workshop EuroNGI New Trends in Modelling, Quantitative Methods and Measurements}, YEAR = {2004}, ADDRESS = {Gliwice,Pologne}, EDITOR = {Tadeuscz Czachorski and Nihal Pekergin}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INBOOK{giavitto04f, PUBLISHER = {Idea Group Publishing}, TITLE = {Molecular Computational Models: Unconventional Approaches}, YEAR = {2004}, AUTHOR = {J.-L. Giavitto and Olivier Michel}, CHAPTER = {Modeling Developmental Processes in MGS}, ALTEDITOR = {}, PAGES = {150--189}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2004/Molecular_Computational_Models.pdf} } @INCOLLECTION{Verlan04a, AUTHOR = {Sergey Verlan}, BOOKTITLE = {Aspects of Molecular Computing. Essays Dedicated to Tom Head on the Occasion of His 70th Birthday}, PUBLISHER = {Springer}, TITLE = {Communicating Distributed H Systems with Alternating Filters}, YEAR = {2004}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {N. Jonoska and Gh. Paun and G. Rozenberg}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {367--384}, SERIES = {LNCS}, OPTTYPE = {}, VOLUME = {2950} } @ARTICLE{BuGrSl:2004:ASPSLTDL, AUTHOR = {D. Burago and D. Grigoriev and Anatol Slissenko}, JOURNAL = {Theoretical Computer Science}, TITLE = {Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon}, YEAR = {2004}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2--3}, PAGES = {371--404}, VOLUME = {315} } @ARTICLE{DBLP:journals/nc/CarboneMCDKSS04, AUTHOR = {Alessandra Carbone and Chengde Mao and Pamela E. Constantinou and Baoquan Ding and Jens Kopatsch and William B. Sherman and Nadrian C. Seeman}, JOURNAL = {Natural Computing}, TITLE = {3D Fractal DNA Assembly from Coding, Geometry and Protection}, YEAR = {2004}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {235-252}, VOLUME = {3}, DOI = {10.1023/B:NACO.0000036819.42166.1a} } @ARTICLE{DBLP:journals/dmtcs/CaspardM04, AUTHOR = {Nathalie Caspard and Bernard Monjardet}, JOURNAL = {Discrete Mathematics & Theoretical Computer Science}, TITLE = {Some lattices of closure systems on a finite set}, YEAR = {2004}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {163-190}, VOLUME = {6}, URL = {http://dmtcs.loria.fr/volumes/abstracts/dm060202.abs.html} } @ARTICLE{IGMA_CerDur04, AUTHOR = {Julien Cervelle and Bruno Durand}, JOURNAL = {Theoretical Computer Science}, TITLE = {Tilings: recursivity and regularity}, YEAR = {2004}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1-3}, PAGES = {469--477}, VOLUME = {310} } @ARTICLE{Crolard:2004:jlc, AUTHOR = {Tristan Crolard}, JOURNAL = {Journal of Logic and Computation}, TITLE = {A formulae-as-types interpretation of Subtractive Logic}, YEAR = {2004}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {529-570}, VOLUME = {14}, URL = {http://hal.ccsd.cnrs.fr/ccsd-00094584/en/} } @ARTICLE{Cegielski:2004:tcs, AUTHOR = {Patrick Cégielski and Malika More}, JOURNAL = {Theoretical Computer Science - B}, TITLE = {Foreword -- Weak Arithmetics}, YEAR = {2004}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {1-3}, VOLUME = {322} } @ARTICLE{DuflotFP04, AUTHOR = {M. Duflot and L. Fribourg and C. Picaronny}, JOURNAL = {Distributed Computing}, TITLE = {Randomized dining philosophers without fairness assumption}, YEAR = {2004}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {65--76}, VOLUME = {17} } @ARTICLE{giavitto04a, AUTHOR = {J.-L. Giavitto and G. Malcolm and Olivier Michel}, JOURNAL = {Comparative and Functional Genomics}, TITLE = {Rewriting systems and the modelling of biological systems}, YEAR = {2004}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {95--99}, VOLUME = {5}, PUBLISHER = {Wiley}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2004/ComparativeFunctionalGenomics04.pdf}, ABSTRACT = { This note presents a short introduction to the use of rewriting system, a notion developed in computer science, as a framework for the modeling and the simulation of various biological processes, especially at a cellular level.} } @ARTICLE{giavitto04k, AUTHOR = {Jean-Louis Giavitto and Olivier Michel and J.-P Banâtre and P. Fradet}, JOURNAL = {Technique et Science Informatique}, TITLE = {Modèles de programmation non-conventionnels}, YEAR = {2004}, OPTMONTH = {}, NOTE = {Compte-rendu de l'atelier international UPP'04.}, OPTNUMBER = {}, PAGES = {177--186}, VOLUME = {23}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2004/tsi-2004.pdf} } @ARTICLE{LGAD2004:IJCIS, AUTHOR = {Frédéric Loulergue and Frédéric Gava and M. Arapinis and Frédéric Dabrowski}, JOURNAL = {International Journal of Computer and Information Science}, TITLE = {Semantics and Implementation of Minimally Synchronous Parallel ML}, YEAR = {2004}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {182--199}, VOLUME = {5}, EDITOR = { W. Dosch, editor, special issue on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing}, PDF = {http://lacl.univ-paris12.fr/gava/papers/loulergue_gava_arapinis_dabrowski_ijcis_2004.pdf} } @ARTICLE{Sliss:2004:LFVTA, AUTHOR = {Anatol Slissenko}, JOURNAL = {Fundamenta Informaticae}, TITLE = {A Logic Framework for Verification of Timed Algorithms}, YEAR = {2004}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {29--67}, VOLUME = {62} } @INPROCEEDINGS{ArapSliss:2004:PBLPH, AUTHOR = {M. Arapinis and Anatol Slissenko}, BOOKTITLE = {Proceeding of the 6th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC-2004), September 26--30, 2004, Timisoara, Rumania --- organized by West University of Timisoara, Romania, and Research Institute for Symbolic Computation Johannes Kepler University, Linz, Austria, September 26--30, 2004}, TITLE = {A Pattern Based Language for Programming of Heuristics of Proof Search}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {D. Petcu and V. Negru and D. Zaharie and T. Jebelen}, OPTMONTH = {}, NOTE = {ISBN 973-661-441-7.}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {400--411}, PUBLISHER = {Editura MIRTON}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{BUnesco:04, AUTHOR = {A. Barbu}, BOOKTITLE = {European Simulation and Modelling Conference (ESM2004)}, TITLE = {A Tool for Supporting the Development of Correct Mobile Application based on Higher Order Pi-Calculus}, YEAR = {2004}, ADDRESS = {UNESC, Paris, France}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {October}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{BMESM:04, AUTHOR = {A. Barbu and F. Mourlin}, BOOKTITLE = {18th European Simulation Multiconference (ESM2004)}, TITLE = {From Pi-Calculus Specification to a Mobile Agent Using JINI}, YEAR = {2004}, ADDRESS = {Magdeburg, Germany}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {June}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Bea:2004:SYNASC, AUTHOR = {Danièle Beauquier}, BOOKTITLE = {6th International Symposium and Numeric Algorithms for Scientific Computing (SYNASC 2004)}, TITLE = {Secrecy for Cryptographic Protocols is Easy}, YEAR = {2004}, ADDRESS = {Timisoara (Roumanie)}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {September}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {412-425}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{blanc_issre04, AUTHOR = {Mathieu Blanc and Pierre Courtieu and Gaetan Hains and Laurent Oudot and Christian Toinard}, BOOKTITLE = {Supplementary Proceedings of the 15th IEEE International Symposium on Software Reliability Engineering (ISSRE2004)}, TITLE = {A novel approach for distributed updates of MAC policies using a meta-protection framework}, YEAR = {2004}, ADDRESS = {Saint Malo, France}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {November}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{ASCD04, AUTHOR = {R. Bouroulet and H. Klaudel and E. Pelz}, BOOKTITLE = {Application of Concurrency to System Design}, TITLE = {A semantics of Security Protocol Language (SPL) using a class of composable high-level Petri nets}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {M. Kishinevsky and Ph. Darondeau}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {99--108}, PUBLISHER = {IIIE}, OPTSERIES = {}, VOLUME = {4th ACSD} } @INPROCEEDINGS{DADS04, AUTHOR = {Bui Thanh, Cécile and Hanna Klaudel and Franck Pommereau}, BOOKTITLE = {Design, Analysis, and Simulation of Distributed Systems}, TITLE = {Box Calculus with High-Level Buffers}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1-6}, PUBLISHER = {SCS}, OPTSERIES = {}, OPTVOLUME = {}, KEYWORDS = {Process algebra, handshake/buffered communication, structured operational semantics, coloured Petri nets}, URL = {http://hal.archives-ouvertes.fr/hal-00114672/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/11/46/72/PDF/2004-dads.pdf}, ABSTRACT = {In this paper, we propose a high-level process algebra allowing to express the exchange of data values using both handshake and buffered communication. This allows a simple and compositional expression of interprocess communication; in particular the buffered one makes easy the representation of program variables, allowing a compact representation of large systems. The process terms are provided with an operational semantics as well as with a denotational one in terms of high-level Petri nets. The main result is that both semantics are consistent in the sense that a term and the corresponding Petri net generate isomorphic transition systems.} } @INPROCEEDINGS{DBLP:conf/birthday/CarboneS04, AUTHOR = {Alessandra Carbone and Nadrian C. Seeman}, BOOKTITLE = {Aspects of Molecular Computing, Essays Dedicated to Tom Head on the Occasion of His 70th Birthday}, TITLE = {Molecular Tiling and DNA Self-assembly}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Natasa Jonoska and Gheorghe Paun and Grzegorz Rozenberg}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {61-83}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {2950}, URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2950&spage=61} } @INPROCEEDINGS{BeCrPr:2004:tacas, AUTHOR = {Tristan Crolard and Evguenia Prokofieva and Danièle Beauquier}, BOOKTITLE = {Proceedings of the Tenth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2004)}, TITLE = {Automatic Parametric Verification of Root Contention Protocol based on Abstract State Machines and First Order Timed Logic}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {372-387}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {2988}, URL = {http://hal.ccsd.cnrs.fr/ccsd-00094616/en/} } @INPROCEEDINGS{dfpv04, AUTHOR = {Tugrul Dayar and Jean-Michel Fourneau and Nihal Pekergin and Jean-Marc Vincent}, BOOKTITLE = {Second International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NET)}, TITLE = {A proof of st-comparison for polynomials of a stochastic matrix and how we can improve the accuracy of st-bounds}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Dima:2004:cavis, AUTHOR = {Catalin Dima}, BOOKTITLE = {Proceedings of the 6th International Symposium on Symbolic and Numeric Computation (SYNASC'04)}, TITLE = {On timed regular languages defined by inverse monoid morphisms}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, ORGANIZATION = {Timisoara, Romania}, PAGES = {439--450}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DiGiSo:2004:formats, AUTHOR = {Catalin Dima and A. Girault and Y. Sorel}, BOOKTITLE = {Proceedings of the Joint International Conferences on Formal Modelling and Analysis of Timed Systems, and on Formal Techniques in Real-Time and Fault-Tolerant Systems (FORMATS/FTRTFT'04)}, TITLE = {Static Fault-Tolerant Real-Time Scheduling with Pseudo-topological Orders}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {215--230}, OPTPUBLISHER = {}, SERIES = {LNCS}, VOLUME = {3253} } @INPROCEEDINGS{DuflotKNP04, AUTHOR = {M. Duflot and M. Z. Kwiatkowska and G. Norman and D. Parker}, BOOKTITLE = {International Symposium on Leveraging Applications of Formal Methods, ISoLA (Preliminary proceedings)}, TITLE = {A Formal Analysis of Bluetooth Device Discovery}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {T. Margaria and B.d Steffen and A. Philippou and M. Reitenspiess}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {268--275}, PUBLISHER = {Department of Computer Science, University of Cyprus}, SERIES = {Technical Report}, VOLUME = {TR-2004-6} } @INPROCEEDINGS{GAVA2004:ICCSb, AUTHOR = {Frédéric Gava}, BOOKTITLE = {The International Conference on Computational Science (ICCS 2004), Part III}, TITLE = {Design of Deparmental Metacomputing ML}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {M. Bubak and van Albada, D. and P. M. A. Sloot and J. Dongarra}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {50--53}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {3038}, URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3038&spage=50}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_iccs_b_2004.pdf} } @INPROCEEDINGS{GAVA2004:ICCSa, AUTHOR = {Frédéric Gava}, BOOKTITLE = {The International Conference on Computational Science (ICCS 2004), Part III}, TITLE = {Parallel I/O in Bulk Synchronous Parallel ML}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {M. Bubak and van Albada, D. and P. Sloot and J. Dongarra}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {339--346}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {3038}, URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3038&spage=331}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_iccs_a_2004.pdf} } @INPROCEEDINGS{GAVA2004:JFLA, AUTHOR = {Frédéric Gava}, BOOKTITLE = {Journées Francophones des Langages Applicatif (JFLA)}, TITLE = {Une bibliothèque certifiée de programmes fonctionnels BSP}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {V. Ménissier-Morain}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {55--68}, PUBLISHER = {INRIA}, SERIES = {Collection Didactique}, OPTVOLUME = {}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_jfla_2004.pdf} } @INPROCEEDINGS{GL2003:PARCO, AUTHOR = {Frédéric Gava and Frédéric Loulergue}, BOOKTITLE = {Parallel Computing: Software Technology, Algorithms, Architectures and Applications, Proceeding of the 10th ParCo Conference}, TITLE = {Semantics of a Functional Bulk Synchronous Parallel Language with Imperative Features}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {G. Joubert and W. Nagel and F. Peters and W. Walter}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {95--102}, PUBLISHER = {Elsevier}, SERIES = {Advances in Parallel Computing}, VOLUME = {13}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_loulergue_parco_2003.pdf} } @INPROCEEDINGS{GePoLa:20004:SSI, AUTHOR = {Xiaocheng Ge and Fiona Polack and Régine Laleau}, BOOKTITLE = {Atelier SSI'04 Sécurité des Systèmes d'Information, INFORSID 2004}, TITLE = {Secure Database Development and the Clark-Wilson Security Model}, YEAR = {2004}, ADDRESS = {Biarritz, France}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {Mai}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{GePoLa:2004:CAISE, AUTHOR = {Xiaocheng Ge and Fiona Polack and Régine Laleau}, BOOKTITLE = {16th International Conference on Advanced Information Systems Engineering, CAiSE 2004}, TITLE = {Secure Databases: an Analysis of Clark-Wilson Model in a Database Environment}, YEAR = {2004}, ADDRESS = {Riga, Latvia}, OPTCROSSREF = {}, EDITOR = {Persson A. and Stirna J.}, MONTH = {June}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {234--247}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {3084} } @INPROCEEDINGS{LOU2003:PARCO, AUTHOR = {F. Loulergue}, BOOKTITLE = {Parallel Computing: Software Technology, Algorithms, Architectures and Applications, Proceeding of the 10th ParCo Conference}, TITLE = {A Calculus of Functional BSP Programs with Explicit Substitution}, YEAR = {2004}, ADDRESS = {Dresden}, OPTCROSSREF = {}, EDITOR = {G. Joubert and W. Nagel and F. Peters and W. Walter}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {North Holland/Elsevier}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{LOU2003:PARCOb, AUTHOR = {F. Loulergue}, BOOKTITLE = {Parallel Computing: Software Technology, Algorithms, Architectures and Applications, Proceeding of the 10th ParCo Conference}, TITLE = {A Event Oriented Functional Parallel Language}, YEAR = {2004}, ADDRESS = {Dresden}, OPTCROSSREF = {}, EDITOR = {G. Joubert and W. Nagel and F. Peters and W. Walter}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {North Holland/Elsevier}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{LOU2004:ICCS, AUTHOR = {F. Loulergue}, BOOKTITLE = {The International Conference on Computational Science (ICCS 2004), Part I}, TITLE = {Communication Primitives for Minimally Synchronous Parallel ML}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {M. Bubak and van Albada, D. and P. Sloot and J. Dongarra}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {411-414}, PUBLISHER = {Springer Verlag}, SERIES = {LNCS}, OPTVOLUME = {} } @INPROCEEDINGS{LOU2004:DAPSYS, AUTHOR = {F. Loulergue}, BOOKTITLE = {Distributed and Parallel Systems (DAPSYS 2004)}, TITLE = {Management of Communication Environments for Minimally Synchronous Parallel ML}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Z. Juhasz and P. Kacsuk and D. Kranzimuller}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {285-292}, PUBLISHER = {Springer}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/ista/LyaletskiDPV04, AUTHOR = {Alexander V. Lyaletski and Anatoly E. Doroshenko and Andrey Paskevich and Konstantin Verchinine}, BOOKTITLE = {Information Systems Technology and its Applications, 3rd International Conference ISTA'2004, June 15-17, 2004, Salt Lake City, Utah, USA, Proceedings}, TITLE = {Evidential Paradigm and Intelligent Mathematical Text Processing}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Anatoly E. Doroshenko and Terry A. Halpin and Stephen W. Liddle and Heinrich C. Mayr}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {205-211}, PUBLISHER = {GI}, SERIES = {LNI}, VOLUME = {48} } @INPROCEEDINGS{DBLP:conf/mkm/LyaletskiPV04, AUTHOR = {Alexander V. Lyaletski and Andrey Paskevich and Konstantin Verchinine}, BOOKTITLE = {Mathematical Knowledge Management, Third International Conference, MKM 2004, Bialowieza, Poland, September 19-21, 2004, Proceedings}, TITLE = {Theorem Proving and Proof Verification in the System SAD}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Andrea Asperti and Grzegorz Bancerek and Andrzej Trybulec}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {236-250}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {3119}, URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3119&spage=236} } @INPROCEEDINGS{MaLa:2004:AFADLa, AUTHOR = {Amel Mammar and Régine Laleau}, BOOKTITLE = {Approches Formelles dans l'Assistance au Développement de Logiciels, AFADL'04}, TITLE = {Génération de code exécutable à partir d'une spécification B : applications aux bases de données}, YEAR = {2004}, ADDRESS = {Besançon, France}, OPTCROSSREF = {}, EDITOR = {J. Julliand}, MONTH = {Juin}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {77--91}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://lifc.univ-fcomte.fr/afadl2004/pages/textes_com.htm} } @INPROCEEDINGS{mammar04:_b, AUTHOR = {A. Mammar and R. Laleau}, BOOKTITLE = {AFADL'04}, TITLE = {Génération de code à partir d'une spécification B: application aux bases de données}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{MaLa:2004:AFADLb, AUTHOR = {Amel Mammar and Régine Laleau}, BOOKTITLE = {Approches Formelles dans l'Assistance au Développement de Logiciels, AFADL'04}, TITLE = {UML2SQL : un environnement intégré pour le développement d'implémentations relationnelles à partir de diagrammes UML}, YEAR = {2004}, ADDRESS = {Besançon, France}, OPTCROSSREF = {}, EDITOR = {J. Julliand}, MONTH = {Juin}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {333--336}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://lifc.univ-fcomte.fr/afadl2004/pages/textes_com.htm} } @INPROCEEDINGS{Verlan04c, AUTHOR = {Maurice Margenstern and Yurii Rogozhin and Sergey Verlan}, BOOKTITLE = {DNA Computing: 9th International Workshop on DNA Based Computers, DNA9, Madison, WI, USA, June 1-3, 2003. Revised Papers}, TITLE = {Time-Varying Distributed H Systems with Parallel Computations: the Problem is Solved}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {J. Chen and J. Reif}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {48--53}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {2943}, URL = {http://www.springerlink.com/content/72nkq0t0nqmtrrn1}, DOI = {10.1007/b95518} } @INPROCEEDINGS{avocs04, AUTHOR = {A. Merlin and G. Hains}, BOOKTITLE = {Fourth Workshop on Automated Verification of Critical Systems: (AVOCS'04)}, TITLE = {A generic cost model for concurrent and data-parallel meta-computing}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {September}, NOTE = {Long preliminary version appears as LIFO RR2004-06}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://www.univ-orleans.fr/SCIENCES/LIFO} } @INPROCEEDINGS{michel04b, AUTHOR = {Olivier Michel and F. Jacquemard}, BOOKTITLE = {Preproceedings of the Fifth workshop on Membrane Computing (WMC5)}, TITLE = {An Analysis of the Needham-Schroeder Public-Key Protocol with MGS}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {G. Mauri and G. Paun and C Zandron}, MONTH = {June}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {295--315}, PUBLISHER = {EC MolConNet - Universita di Milano-Bicocca}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/2004/wmc-04.ps}, ABSTRACT = {In this paper, we develop an analysis of the Needham-Schroeder Public-Key Protocol in the framework of membrane computing. This analysis is used to validate the protocol and exhibits, as expected, a well known logical attack. The novelty of our approach is to use multiset rewriting in a nest of membranes. The use of membranes enables to tight the conditions for detecting an attack. The approach has been validated by developing a full implementation for several versions of the analysis.} } @INPROCEEDINGS{MICHON:2004:HAL-00081338:1, AUTHOR = {Jean-Francis Michon and Pierre Valarcher and Jean-Baptiste Yunès}, BOOKTITLE = {Proceedings of CCC'03}, TITLE = {HFE and BDDs: A Practical Attempt at Cryptanalysis}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Feng, Niedereiter, Xing}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {11}, PUBLISHER = {Birkhauser}, OPTSERIES = {}, OPTVOLUME = {}, KEYWORDS = {cryptanalysis, BDD, HFE}, URL = {http://hal.archives-ouvertes.fr/hal-00081338/en/}, ABSTRACT = {{HFE} ({H}idden {F}ield {E}quations) is a public key cryptosystem using univariate polynomials over finite fields. {I}t was proposed by {J}. {P}atarin in 1996. {W}ell chosen parameters during the construction produce a system of quadratic multivariate polynomials over {GF}(2) as the public key. {A}n enclosed trapdoor is used to decrypt messages. {W}e propose a ciphertext-only attack which mainly consists in satisfying a boolean formula. {O}ur algorithm is based on {BDD}s ({B}inary {D}ecision {D}iagrams), introduced by {B}ryant in 1986, which allow to represent and manipulate, possibly efficiently, boolean functions. {T}his paper is devoted to some experimental results we obtained while trying to solve the {P}atarin's challenge. {T}his approach was not successful, nevertheless it provided some interesting information about the security of {HFE} cryptosystem.} } @INPROCEEDINGS{EvTrLaFr:2004:SEFM, AUTHOR = {Evans N. and Treharne H. and Régine Laleau and Marc Frappier}, BOOKTITLE = {2nd IEEE International Conference on Software Engineering and Formal Methods}, TITLE = {How to Verify Dynamic Properties of Information Systems}, YEAR = {2004}, ADDRESS = {Beijing, China}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {September}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {416--425}, PUBLISHER = {IEEE Computer Society Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Pol04b, AUTHOR = {Emmanuel Polonowski}, BOOKTITLE = {Proceedings of the econd International Workshop on Higher Order Rewriting (HOR 2004)}, TITLE = {PSN implies SN}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, SERIES = {Technical report of the Computer Science Department of RWTH Aachen}, OPTVOLUME = {} } @INPROCEEDINGS{Pol04a, AUTHOR = {Emmanuel Polonowski}, BOOKTITLE = {Proceedings of the 7th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2004)}, TITLE = {Strong normalization of lambda-bar-mu-mu-tilde-calculus with explicit substitutions}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {423--437}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {2987} } @INPROCEEDINGS{PAPP04, AUTHOR = {Franck Pommereau}, BOOKTITLE = {The International Conference on Computational Science}, TITLE = {Petri nets as Executable Specifications of High-Level Timed Parallel Systems}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {M. Bubak and van Albada, D. and P. Sloot and J. Dongarra}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {331-338}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {3038}, KEYWORDS = {Petri nets, parallelism, real-time, execution machines}, URL = {http://hal.archives-ouvertes.fr/hal-00114671/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/11/46/71/PDF/2004-papp.pdf}, ABSTRACT = {We propose to use high-level Petri nets for the semantics of high-level parallel systems. This model is known to be useful for the of verification and we show that it is also executable in a parallel way. Executing a Petri net is easy in general but more complicated in a timed context, which makes necessary to synchronise the internal time of the Petri net with the real time of its environment. Another problem is to relate the execution of a Petri net, which has its own semantics, to that of its environment; i.e., to properly handle input/output. This paper presents a parallel algorithm to execute Petri nets with time enforcing the even progression of the internal time with respect to the real time and allowing the exchange of information with the environment. We define a class of Petri nets suitable for a parallel execution machine which preserves the step sequence semantics of the nets and ensures time consistent executions while taking into account the solicitation of its environment. The question of the efficient verification of such nets has been addressed in a separate paper, the present one is focused on the practical aspects involved in the execution of so modelled systems.} } @INPROCEEDINGS{DADS07, AUTHOR = {Franck Pommereau}, BOOKTITLE = {Design, Analysis, and Simulation of Distributed Systems}, TITLE = {Versatile Boxes: a Multi-Purpose Algebra of High-Level Petri nets}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {665-672}, PUBLISHER = {SCS/ACM}, OPTSERIES = {}, OPTVOLUME = {}, KEYWORDS = {algebra of Petri nets, threads, exceptions}, ABSTRACT = {This paper introduces a model of composable Petri nets, called Versatile Boxes, that has all the high-level features already introduced in the family of the Petri Box Calculus (mainly: data and time representation) as well as a new interruption capability. This allows for defining processes that are able to interrupt their execution at any point, just as a program can raise an exception. By choosing a carefully tuned level of generality, we are able to obtain a model that is much simpler than previous approaches, while still allowing to give the semantics of the usual programming language constructs. We believe that our model has the required characteristics for a very general use, hence its name. On the other hand, its is not very complex and so it should be easy to understand or implement and efficient for verification or simulation purpose.} } @INPROCEEDINGS{spicher04c, AUTHOR = {Antoine Spicher and Olivier Michel}, BOOKTITLE = {International Workshop on Implementation and Application of Functional Languages (IFL04)}, TITLE = {Integration and pattern-matching of topological structures in a functional language}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {draft proceedings published as a technical report of the Institute of Computer Science of the University of Kiel}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2004/IFL04.pdf }, ABSTRACT = {MGS is an experimental programming language dedicated to the manipulation of topological collections through rules of transformations. A topological collection is a set of elements organized by a neighborhood relation. This topological approach enables the extension of the case based definition of function to several non-algebraic data types. In this paper, we show how sophisticated data structures used to build geometric objects can be embedded smoothly in this framework. The expressivity of the language is then illustrated by some examples like the simulation of a diffusion limited aggregation process on complex geometries and the computation of the maximal flow on a graph.} } @INPROCEEDINGS{spicher04d, AUTHOR = {Antoine Spicher and Olivier Michel}, BOOKTITLE = {11ème Journées du GT Animation et Simulation (GTAS'2004)}, TITLE = {Manipulations de structures topologiques dans un langage déclaratif pour la simulation}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {AFIG et LERI, Université de Reims}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2004/gtas04.pdf}, ABSTRACT = { MGS est un langage de programmation expérimental permettant de manipuler des collections topologiques par des règles de transformation. Une collection topologique est un ensemble de valeurs muni d'une relation de voisinage. Cette approche permet d'exprimer simplement l'état d'un système dynamique et son évolution. La présentation du langage est faite à travers plusieurs exemples, dont un processus de diffusion et d'agrégation sur plusieurs quasi-variétés modélisées par des G-cartes.} } @INPROCEEDINGS{spicher04b, AUTHOR = {Antoine Spicher and Olivier Michel and Jean-Louis Giavitto}, BOOKTITLE = {Sixth International conference on Cellular Automata for Research and Industry (ACRI'04)}, TITLE = {A topological framework for the specification and the simulation of discrete dynamical systems}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {238--247}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {3305}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2004/acri04.pdf}, ABSTRACT = { MGS is an experimental programming language for the modeling and the simulation of discrete dynamical systems. The modeling approach is based on the explicit specification of the interaction structure between the system parts. This interaction structure is adequately described by topological notions. The topological approach enables a unified view on several computational mechanisms initially inspired by biological or chemical processes (Gamma and \emph{cellular automata}). The expressivity of the language is illustrated by the modeling of a diffusion limited aggregation process on a wide variety of spatial domain: from cayley graphs to arbitrary quasi-manifolds.} } @INPROCEEDINGS{netgenom, AUTHOR = {C. Bui Thanh}, BOOKTITLE = {Modelling and Simulation '2004, European Simulation and Modelling Conference}, TITLE = {Generating Coloured Petri Nets of Concurrent Object-Oriented Programs}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{thanh04:_objec_orien_model_high_level, AUTHOR = {Cécile Bui Thanh and Hanna Klaudel}, BOOKTITLE = {Integrated Formal Methods: 4th International Conference, IFM 2004}, TITLE = {Object-Oriented Modelling with High-Level Modular Petri Nets}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {E.A. Boiten, J. Derrick, G. Smith}, MONTH = {April}, OPTNOTE = {}, NUMBER = {2999}, OPTORGANIZATION = {}, PAGES = {287-306}, PUBLISHER = {Springer}, SERIES = {LNCS}, OPTVOLUME = {} } @INPROCEEDINGS{Verlan04b, AUTHOR = {S. Verlan}, BOOKTITLE = {Developments in Language Theory: 8th International Conference, DLT 2004. Auckland, New Zealand, December 13-17, 2004. Proceedings}, TITLE = {Tissue P Systems with Minimal Symport/Antiport}, YEAR = {2004}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {C. S. Calude and E. Calude and M. J. Dinneen}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {418--430}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {3340}, URL = {http://www.springerlink.com/content/305m89rg43kjje9d}, DOI = {10.1007/b103739} } @TECHREPORT{lifo2004-03, AUTHOR = {S. Anantharaman and J. Chen and G. Hains}, INSTITUTION = {LIFO, Laboratoire d'Informatique Fondamentale d'Orléans}, TITLE = {A timed Synchronous Algebra for Information Flow Analysis}, YEAR = {2004}, ADDRESS = {Université d'Orléans}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {RR-2004-03}, TYPE = {Rapport de Recherche}, PS = {http://www.univ-orleans.fr/SCIENCES/LIFO/prodsci/rapports/RR/RR2004/RR-2004-03.ps.gz} } @TECHREPORT{TR-LACL-2004-08, AUTHOR = {D. Beauquier}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Secrecy for Cryptographic Protocols is Easy}, YEAR = {2004}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2004-08}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2004-08.pdf} } @TECHREPORT{TR-LACL-2004-04, AUTHOR = {D. Beauquier and A. Slissenko}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Periodicity Based Decidable Classes in a First Order Timed Logic}, YEAR = {2004}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2004-04}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2004-04.pdf} } @TECHREPORT{TR-LACL-2004-01, AUTHOR = {R. Bouroulet and H. Klaudel and E. Pelz}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A semantics of Security Protocol Language (SPL) using a class of composable high-level Petri nets}, YEAR = {2004}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2004-01}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2004-01.pdf} } @TECHREPORT{TR-LACL-2004-03, AUTHOR = {N. Caspard and C. Le Conte Poly-Barbut}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Tamari lattices are bounded: a new proof}, YEAR = {2004}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2004-03}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2004-03.pdf} } @TECHREPORT{TR-LACL-2004-05, AUTHOR = {Frédéric Gava}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Parallel I/O in Bulk Synchronous Parallel ML}, YEAR = {2004}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2004-05}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2004-05.pdf} } @TECHREPORT{TR-LACL-2004-09, AUTHOR = {F. Gava and F Loulergue}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A Functional Language for Departmental Metacomputing}, YEAR = {2004}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2004-09}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2004-09.pdf} } @TECHREPORT{GeFrLa:2004:RT683, AUTHOR = {Frédéric Gervais and Marc Frappier and Régine Laleau}, INSTITUTION = {CEDRIC}, TITLE = {Synthesizing B Substitutions for EB$^{3}$ Attribute Definitions}, YEAR = {2004}, ADDRESS = {Paris, France}, MONTH = {November}, OPTNOTE = {}, NUMBER = {683}, OPTTYPE = {} } @TECHREPORT{giavitto04j, AUTHOR = {Jean-Louis Giavitto and Olivier Michel and Julien Cohenn and A. Spicher}, INSTITUTION = {Laboratoire des Méthodes Informatiques, UMR 8042 du CNRS}, TITLE = {Computation in Space and Space in Computation}, YEAR = {2004}, OPTADDRESS = {}, MONTH = {May}, NOTE = {22 p.}, NUMBER = {103-2004}, OPTTYPE = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2004/rt-104-2004.pdf }, ABSTRACT = {This text and these questions were written in order to cause discussions at the Unconventional Programming Paradigms (UPP04) international workshop held the 15--17 September 2004 at the Mont Saint-Michel, France. This workshop is dedicated to \emph{Challenges, Visions and Research Issues for New Programming Paradigms}. We hope that this text will stimulate fertile exchanges between the participants.} } @TECHREPORT{laleau04:_uml2s, AUTHOR = {R. Laleau and A. Mammar}, INSTITUTION = {CEDRIC (CNAM)}, TITLE = {UML2SQL: An Integrated Environment for the Development of UML and SQL Specifications}, YEAR = {2004}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {643}, OPTTYPE = {} } @TECHREPORT{TR-LACL-2004-02, AUTHOR = {F. Loulergue}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Communication Primitives for Minimally Synchronous Parallel ML}, YEAR = {2004}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2004-02}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2004-02.pdf} } @TECHREPORT{TR-LACL-2004-06, AUTHOR = {F. Loulergue}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Management of Communiation Environments in MSPML}, YEAR = {2004}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2004-06}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2004-06.pdf} } @TECHREPORT{michel04a, AUTHOR = {Olivier Michel and F. Jacquemard and J.-L. Giavitto}, INSTITUTION = {LaMI -- Université d'Evry - CNRS}, TITLE = {Three variations on the analysis of the Needham-Schroeder Public-Key Protocol with MGS}, YEAR = {2004}, OPTADDRESS = {}, MONTH = {May}, NOTE = {25 p.}, NUMBER = {LaMI-98-2004}, OPTTYPE = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2004/rt-98-2004.pdf}, ABSTRACT = { In this paper, we develop an analysis of the Needham-Schroeder Public-Key Protocol (NSPK) using a P system approach. This analysis is used to validate the protocol and exhibits, as expected, a well known logical attack. The novelty of our approach is to use MGS, a P system like formalism, to find the attack by a systematic state exploration. The use of multiset rewriting has already been advocated for the development of protocol validation tools. In this work, we focus on the use of nested multisets (i.e. membranes). The use of membranes enables to tight the conditions for detecting an attack. All the three proposed version of the analysis have been successfully implemented in MGS and we conclude the paper by a discussion on how the MGS programs can be translated into standard P systems.} } @TECHREPORT{spicher04a, AUTHOR = {Antoine Spicher and Olivier Michel and Jean-Louis Giavitto}, INSTITUTION = {Laboratoire des Méthodes Informatiques, UMR 8042 du CNRS}, TITLE = {A topological framework for the specification and the simulation of discrete dynamical systems}, YEAR = {2004}, OPTADDRESS = {}, MONTH = {May}, OPTNOTE = {}, NUMBER = {LaMI-99-2004}, OPTTYPE = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2004/rt-99-2004.pdf}, ABSTRACT = {MGS is an experimental programming language for the modeling and the simulation of discrete dynamical systems. The modeling approach is based on the explicit specification of the interaction structure between the system parts. This interaction structure is adequately described by topological notions. The topological approach enables a unified view on several computational mechanisms initially inspired by biological or chemical processes (Gamma and the CHAM, Lindenmayer systems, P systems and cellular automata). The expressivity of the language is illustrated by the modeling of a diffusion limited aggregation process on a wide variety of spatial domain: from cayley graphs to arbitrary manifolds.} } @MISC{Ge:2004:predoc, AUTHOR = {Frédéric Gervais}, HOWPUBLISHED = {Dissertation for the general examination, Université de Sherbrooke (Québec), Canada}, MONTH = {June}, OPTNOTE = {}, TITLE = {EB$^{4}$ : Vers une méthode combinée de spécification formelle des systèmes d'information}, YEAR = {2004} } @PROCEEDINGS{hlpp2003, TITLE = {Preface: Special Issue on High-Level Parallel Programming and Applications (Selected papers from HLPP2003)}, YEAR = {2003}, OPTADDRESS = {}, EDITOR = {G. Hains and F. Loulergue}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PUBLISHER = {World Scientific}, OPTSERIES = {}, VOLUME = {13, number 3}, BOOKTITLE = {Parallel Processing Letters}, PAGES = {313--316} } @INCOLLECTION{Dima:2003:paun, AUTHOR = {Catalin Dima}, BOOKTITLE = {Grammars and Automata for String Processing: from Mathematics and Computer Science to Biology, and Back, Essays in honor of Gheorghe P aun, Topics in Computer Mathematics vol. 9}, PUBLISHER = {Taylor and Francis}, TITLE = {Distributed Real-Time Automata}, YEAR = {2003}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {C. Martin-Vide and V. Mitrana}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {131--140}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @ARTICLE{Bea:2003:TCS2, AUTHOR = {Danièle Beauquier}, JOURNAL = {Theoretical Computer Science}, TITLE = {On probabilistic timed automata}, YEAR = {2003}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {65-84}, VOLUME = {292} } @ARTICLE{Bea:2003:TCS1, AUTHOR = {Danièle Beauquier and Maurice Nivat}, JOURNAL = {Theoretical Computer Science}, TITLE = {A codicity problem in the plane}, YEAR = {2003}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {417-430}, VOLUME = {303} } @ARTICLE{DBLP:journals/tcs/CarboneG03, AUTHOR = {Alessandra Carbone and Misha Gromov}, JOURNAL = {Theor. Comput. Sci.}, TITLE = {Functional labels and syntactic entropy on DNA strings and proteins}, YEAR = {2003}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {303}, PAGES = {35-51}, VOLUME = {1}, DOI = {10.1016/S0304-3975(02)00443-7} } @ARTICLE{DBLP:journals/nc/CarboneS03, AUTHOR = {Alessandra Carbone and Nadrian C. Seeman}, JOURNAL = {Natural Computing}, TITLE = {Coding and geometrical shapes in nanostructures: A fractal DNA-assembly}, YEAR = {2003}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {133-151}, VOLUME = {2}, DOI = {10.1023/A:1024943106163} } @ARTICLE{DBLP:journals/bioinformatics/CarboneZK03, AUTHOR = {Alessandra Carbone and Andrey Zinovyev and François Képès}, JOURNAL = {Bioinformatics}, TITLE = {Codon adaptation index as a measure of dominating codon bias}, YEAR = {2003}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {16}, PAGES = {2005-2015}, VOLUME = {19} } @ARTICLE{DBLP:journals/dam/CaspardM03, AUTHOR = {Nathalie Caspard and Bernard Monjardet}, JOURNAL = {Discrete Applied Mathematics}, TITLE = {The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: A Survey}, YEAR = {2003}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {241-269}, VOLUME = {127}, DOI = {10.1016/S0166-218X(02)00209-3} } @ARTICLE{CosKesPol03, AUTHOR = {Roberto Di Cosmo and Delia Kesner and Emmanuel Polonowski}, JOURNAL = {Mathematical Structures in Computer Science}, TITLE = {Proof nets and explicit substitutions}, YEAR = {2003}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {409--450}, VOLUME = {13} } @ARTICLE{DFP03, AUTHOR = {Tugrul Dayar and Jean-Michel Fourneau and Nihal Pekergin}, JOURNAL = {RAIRO Recherche Oprationnelle}, TITLE = {Transforming stochastic matrices for stochastic comparison with the st order}, YEAR = {2003}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {85-97}, VOLUME = {37}, PUBLISHER = {EDP Sciences} } @ARTICLE{FI03, AUTHOR = {Raymond Devillers and Hanna Klaudel and Maciej Koutny and Franck Pommereau}, JOURNAL = {Fundamenta Informaticae}, TITLE = {Asynchonous Box Calculus.}, YEAR = {2003}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {1-50}, VOLUME = {54}, KEYWORDS = {Petri nets, process algebra, synchronous and asynchronous communication, structured operational semantics}, PUBLISHER = {IOS Press}, URL = {http://hal.archives-ouvertes.fr/hal-00114675/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/11/46/75/PDF/2003-fi.pdf }, ABSTRACT = {The starting point of this paper is an algebraic Petri net framework allowing one to express net compositions, such as iteration and parallel composition, as well as transition synchronisation and restriction. We enrich the original model by introducing new constructs supporting asynchronous interprocess communication. Such a communication is made possible thanks to special _buffer_ places where different transitions (processes) may deposit and remove tokens. We also provide an abstraction mechanism, which hides buffer places, effectively making them private to the processes communicating through them. We then provide an algebra of process expressions, whose constants and operators directly correspond to those used in the Petri net framework. Such a correspondence is used to associate nets to process expressions in a compositional way. That the resulting algebra of expressions is consistent with the net algebra is demonstrated by showing that an expression and the corresponding net generate isomorphic transition systems. This results in the Asynchronous Box Calculus (or ABC), which is a coherent dual model, based on Petri nets and process expressions, suitable for modelling and analysing distributed systems whose components can interact using both synchronous and asynchronous communication.} } @ARTICLE{hk-tcs, AUTHOR = {Raymond Devillers and Hanna Klaudel and R.-C. Riemann}, JOURNAL = {Theoretical Computer Science}, TITLE = {General Parameterised Refinement and Recursion for the M-net Calculus}, YEAR = {2003}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {235-258}, VOLUME = {300} } @ARTICLE{GAVA2003:PPL, AUTHOR = {Frédéric Gava}, JOURNAL = {Parallel Processing Letters}, TITLE = {Formal Proofs of Functional BSP Programs}, YEAR = {2003}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {365--376}, VOLUME = {13}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_ppl_2003.pdf}, DOI = {10.1142/S0129626403001343} } @ARTICLE{giavitto03cbis, AUTHOR = {J.-L. Giavitto and O. Michel}, JOURNAL = {Physics of Life}, TITLE = {Modeling the topological organization of cellular processes}, YEAR = {2003}, OPTMONTH = {}, NOTE = {See http://www.physicsoflife.com/index.html. Republication of in the Elsevier electronic Journal ``Physics of Life'' (this journal contains selected articles that have been published in 22 contributing journals from Elsevier Science, covering Physics, Biology, Chemistry and Medicine with a focus on biological physics research).}, NUMBER = {3}, OPTPAGES = {}, OPTVOLUME = {}, URL = {http://www1.elsevier.com/homepage/sak/physolife/archive/2003_3.htm} } @ARTICLE{giavitto03bbis, AUTHOR = {Jean-Louis Giavitto and Olivier Michel}, JOURNAL = {BioSystems}, TITLE = {Modeling the topological organization of cellular processes}, YEAR = {2003}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {70}, PAGES = {149-163}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2003/biosystem02.pdf}, ABSTRACT = { The cell as a dynamical system presents the characteristics of having a dynamical structure. That is, the exact phase space of the system cannot be fixed before the evolution and integrative cell models must state the evolution of the structure jointly with the evolution of the cell state. This kind of dynamical systems is very challenging to model and simulate. New programming concepts must be developed to ease their modeling and simulation. In this context, the goal of the MGS project is to develop an experimental programming language dedicated to the simulation of this kind of systems. MGS proposes a unified view on several computational mechanisms (CHAM, Lindenmayer systems, Paun systems, cellular automata) enabling the specification of spatially localized computations on heterogeneous entities. The evolution of a dynamical structure is handled through the concept of transformation which relies on the topological organization of the system components. An example based on the modeling of spatially distributed biochemical networks is used to illustrate how these notions can be used to model the spatial and temporal organization of intracellular processes.} } @ARTICLE{giavitto03a, AUTHOR = {J.-L. Giavitto and O. Michel and F. Delaplace}, JOURNAL = {BioSystems}, TITLE = {Declarative simulation of dynamicals systems : the $8 1/2$ programming language and its application to the simulation of genetic networks}, YEAR = {2003}, MONTH = {feb/march}, OPTNOTE = {}, NUMBER = {2--3}, PAGES = {155--170}, VOLUME = {68}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2003/biosystem02bis.pdf }, ABSTRACT = { The cell as a dynamical system presents the characteristics of having a dynamical structure. That is, the exact phase space of the system cannot be fixed before the evolution and integrative cell models must state the evolution of the structure jointly with the evolution of the cell state. This kind of dynamical systems is very challenging to model and simulate. New programming concepts must be developed to ease their modeling and simulation. In this context, the goal of the MGS project is to develop an experimental programming language dedicated to the simulation of this kind of systems. MGS proposes a unified view on several computational mechanisms (CHAM, Lindenmayer systems, Paun systems, cellular automata) enabling the specification of spatially localized computations on heterogeneous entities. The evolution of a dynamical structure is handled through the concept of transformation which relies on the topological organization of the system components. An example based on the modeling of spatially distributed biochemical networks is used to illustrate how these notions can be used to model the spatial and temporal organization of intracellular processes.} } @ARTICLE{jfp2003, AUTHOR = {G. Hains}, JOURNAL = {Journal of functional Programming}, TITLE = {Book Review on Implicit parallel programming in pH by R. S. Nikhil and Arvind, Morgan Kaufmann, 2001}, YEAR = {2003}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {824-826}, VOLUME = {13}, PUBLISHER = {Cambridge University Press} } @ARTICLE{DBLP:journals/dke/WijsenB03, AUTHOR = {Jef Wijsen and Alexis Bès}, JOURNAL = {Data Knowl. Eng.}, TITLE = {On query optimization in a temporal SPC algebra}, YEAR = {2003}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {165-192}, VOLUME = {44} } @INPROCEEDINGS{avocs03, AUTHOR = {S. Anantharaman and G. Hains}, BOOKTITLE = {Third Workshop on Automated Verification of Critical Systems: (AVOCS'03)}, TITLE = {A Synchronous Bisimulation-Based Approach for Information Flow Analysis}, YEAR = {2003}, ADDRESS = {Southampton, (UK)}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {April}, NOTE = {Long preliminary version appears as LIFO RR2003-01}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://www.univ-orleans.fr/SCIENCES/LIFO} } @INPROCEEDINGS{unif03, AUTHOR = {S. Anantharaman and G. Hains}, BOOKTITLE = {Proc. of the Workshop UNIF'03, Int. Conf. RDP'03, Valencia, Spain}, TITLE = {Information Flow Analysis via Equational Reasoning}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {J. Levy}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Universidad Politecnica de Valencia}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{ALGD2003:SNPD, AUTHOR = {Myrto Arapinis and Frédéric Loulergue and Frédéric Gava and Frédéric Dabrowski}, BOOKTITLE = {4th International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'03)}, TITLE = {Semantics of Minimally Synchronous Parallel ML}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {W. Dosch and R. Y. Lee}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {260--267}, PUBLISHER = {ACIS}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://lacl.univ-paris12.fr/gava/papers/arapinis_loulergue_gava_dabrowski_snpd_2003.pdf} } @INPROCEEDINGS{BM2003:CSITeA03, AUTHOR = {A. Barbu and F. Mourlin}, BOOKTITLE = {International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications (CSITeA'03)}, TITLE = {From Higher Order Pi-Calculus Specification to RMI Implementation}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{BMSNPD:04, AUTHOR = {A. Barbu and F. Mourlin}, BOOKTITLE = {4th International Conference on Software Engineering, Artificial Intelligence, and Parallel/Distributed Computing (SNPD'03)}, TITLE = {Higher Order Pi-Calculus Specification for a Mobile Agent in JINI}, YEAR = {2003}, ADDRESS = {Lübeck, Germany}, OPTCROSSREF = {}, EDITOR = { ACIS}, MONTH = {October}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {250--256}, PUBLISHER = {W. Dosch}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{barbu03:_une_pi_calcul, AUTHOR = {A. Barbu and F. Mourlin}, BOOKTITLE = {Majecstic'03, Manifestation des jeunes chercheures STIC}, TITLE = {Une spécification d'ordre supérieur Pi-Calcul d'un agent mobile}, YEAR = {2003}, ADDRESS = {Marseille, France}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{BeCrPr:2003:AVOCS, AUTHOR = {Danièle Beauquier and Tristan Crolard and E. Prokofieva}, BOOKTITLE = {Third Workshop on Automated Verification of Critical Systems (AVoCS'2003)}, TITLE = {Automatic Verification of Real Time Systems: A Case Study}, YEAR = {2003}, ADDRESS = {Southampton (UK)}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {April}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {98--108}, OPTPUBLISHER = {}, SERIES = {Technical Report of the University of Southampton}, OPTVOLUME = {} } @INPROCEEDINGS{IGMA_coiBlaCerFor03, AUTHOR = {François Blanchard and Julien Cervelle and Enrico Formenti}, BOOKTITLE = {28th International Symposium on Mathematical Foundations of Computer Science (MFCS'03)}, TITLE = {Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Branislav Rovan and Peter Vojtás}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {228--238}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {2747} } @INPROCEEDINGS{BlGeLa:2003:ZB, AUTHOR = {Sandrine Blazy and Frédéric Gervais and Régine Laleau}, BOOKTITLE = {ZB 2003: Formal Specification and Development in Z and B, Third International Conference of B and Z Users, Turku, Finland}, TITLE = {Reuse of Specification Patterns with the B Method.}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {June}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {40-57}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {2651}, PDF = {http://cedric.cnam.fr/PUBLIS/RC443.pdf} } @INPROCEEDINGS{blazy03:_une, AUTHOR = {S. Blazy and F. Gervais and R. Laleau}, BOOKTITLE = {Objets, Composants et ModéNhles dans l'ingénierie des SI, Workshop associé à INFORSID}, TITLE = {Une démarche outillée pour spécifier formellement des patrons de conception réutilisables}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://cedric.cnam.fr/PUBLIS/RC484.pdf} } @INPROCEEDINGS{BlGeLa:2003:OCMSI, AUTHOR = {Sandrine Blazy and Frédéric Gervais and Régine Laleau}, BOOKTITLE = {Workshop Objets, Composants et Modèles dans l'ingénierie des SI (OCM-SI)}, TITLE = {Une démarche outillée pour spécifier formellement des patrons de conception réutilisables}, YEAR = {2003}, ADDRESS = {Nancy, France}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {3 June}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {5-9}, PUBLISHER = {INFORSID}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://cedric.cnam.fr/PUBLIS/RC484.pdf} } @INPROCEEDINGS{MTCS02, AUTHOR = {Bui Thanh, Cécile and Hanna Klaudel and Franck Pommereau}, BOOKTITLE = {}, TITLE = {Petri nets with causal time for system verification}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {5}, OPTORGANIZATION = {}, PAGES = {1-16}, PUBLISHER = {Elsevier}, SERIES = {Electronic Notes in Theoretical Computer Science}, VOLUME = {68}, URL = {http://hal.archives-ouvertes.fr/hal-00114682/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/11/46/82/PDF/2002-mtcs.pdf}, ABSTRACT = {We present a new approach to the modelling of time constrained systems. It is based on untimed high-level Petri nets using the concept of causal time. With this concept, the progression of time is modelled in the system by the occurrence of a distinguished event, tick, which serves as a reference to the rest of the system. In order to validate this approach as suitable for automated verification, a case study is provided and the results obtained using a model-checker on high-level Petri nets are compared with those obtained for timed automata using prominent tools. The comparison is encouraging and shows that the causal time approach is intuitive and modular. It also potentially allows for efficient verification.} } @INPROCEEDINGS{IGMA_CerFor03, AUTHOR = {Julien Cervelle and Enrico Formenti}, BOOKTITLE = {20th International Symposium on Theoretical Aspects of Computer Science (STACS'03)}, TITLE = {On Sand Automata}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Helmut Alt and Michel Habib}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {642--653}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {2607} } @INPROCEEDINGS{CohSliss:2003:IRTS, AUTHOR = {Joëlle Cohen and Anatol Slissenko}, BOOKTITLE = {Proc. of the 4th Intern. Conf. on Computer Science and Information Technology (CSIT'2003), September 22--26, 2003, Yerevan, Armenia. Organized by National Academy of Science of Armenia in cooperation with Test Technology Technical Council of IEEE Computer Society}, TITLE = {On implementations of distributed real-time abstract state machines}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {(Plenary talk.)}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {13--18}, PUBLISHER = {National Academy of Science of Armenia}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{jfla03, AUTHOR = {Julien Cohenn and Olivier Michel and Jean-Louis Giavitto}, BOOKTITLE = {Journées Francophones des Langages Applicatifs}, TITLE = {Filtrage et règles de réécriture sur des structures indexées par des groupes}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/2003/JFLA03.ps.gz} } @INPROCEEDINGS{DL2003:PDCN, AUTHOR = {F. Dabrowski and F. Loulergue}, BOOKTITLE = {$21^{\mbox{st}}$ IASTED International Multi-conference, Applied Informatics (AI 2003), Symposium on Parallel and Distributed Computing and Networks}, TITLE = {Functional Bulk Synchronous Programming in C++}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {february}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {462-467}, PUBLISHER = {ACTA Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DLG2003:SNPD, AUTHOR = {Frédéric Dabrowski and Frédéric Loulergue and Frédéric Gava}, BOOKTITLE = {4th International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'03)}, TITLE = {Pattern Matching of Parallel Values in Bulk Synchronous Parallel ML}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {W. Dosch and R. Y. Lee}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {301--308}, PUBLISHER = {ACIS}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://lacl.univ-paris12.fr/gava/papers/dabrowski_loulergue_gava_snpd_2003.pdf} } @INPROCEEDINGS{AMAST02, AUTHOR = {Raymond Devillers and Hanna Klaudel and M. Koutny and Franck Pommereau}, BOOKTITLE = {Algebraic Methodology And Software Technology (AMAST'2002)}, TITLE = {An Algebra of non-safe Petri Boxes.}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {H. Kirchner, C. Ringeissen}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {192-207}, PUBLISHER = {Springer Verlag}, SERIES = {Lecture Notes in Computer Science}, OPTVOLUME = {} } @INPROCEEDINGS{Dima:2003:formats, AUTHOR = {Catalin Dima}, BOOKTITLE = {Proceedings of the First International Workshop on Formal Modeling and Analysis of Timed Systems (FORMATS'03)}, TITLE = {A nonarchimedian discretization for timed languages}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {161--181}, OPTPUBLISHER = {}, SERIES = {LNCS}, VOLUME = {2791} } @INPROCEEDINGS{Dima:2003:dmtcs, AUTHOR = {Catalin Dima}, BOOKTITLE = {Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science (DMTCS'03)}, TITLE = {Timed regular expressions with colored parentheses}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {141--154}, OPTPUBLISHER = {}, SERIES = {LNCS}, VOLUME = {2731} } @INPROCEEDINGS{DBLP:conf/stacs/DurandH03, AUTHOR = {Arnaud Durand and Miki Hermann}, BOOKTITLE = {STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings}, TITLE = {The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Helmut Alt and Michel Habib}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {451-462}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {2607}, URL = {http://link.springer.de/link/service/series/0558/bibs/2607/26070451.htm} } @INPROCEEDINGS{EssSliss:2003:HAPSPP, AUTHOR = {T. Essafi and Anatol Slissenko}, BOOKTITLE = {Proc. of the 4th Intern. Conf. on Computer Science and Information Technology (CSIT'2003), September 22--26, 2003, Yerevan, Armenia. Organized by National Academy of Science of Armenia in cooperation with Test Technology Technical Council of IEEE Computer Society}, TITLE = {A heuristic algorithm for proving the security property of some protocols}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {58--62}, PUBLISHER = {National Academy of Science of Armenia}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{fleischhack03:_hierar_timed_high_level_nets_branc_proces, AUTHOR = {H. Fleischhack and E. Pelz}, BOOKTITLE = {ICATPN'03}, TITLE = {Hierarchical Timed High Level Nets and their Branching Processes}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2679}, OPTORGANIZATION = {}, PAGES = {397-416}, PUBLISHER = {Springer}, SERIES = {LNCS}, OPTVOLUME = {} } @INPROCEEDINGS{fleischhack03:_high_level_branc_proces_high, AUTHOR = {H. Fleischhack and E. Pelz}, BOOKTITLE = {Proceedings of High Performances Computing Conference}, TITLE = {High Level Branching Processes for High Level Petri Nets}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {246-253}, PUBLISHER = {SCS}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/mascots/FourneauCPQ03, AUTHOR = {Jean-Michel Fourneau and Mathieu Le Coz and Nihal Pekergin and Franck Quessette}, BOOKTITLE = {11th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)}, TITLE = {An open tool to compute stochastic bounds on steady-state distributions and rewards}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {219}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://csdl.computer.org/comp/proceedings/mascots/2003/2039/00/20390219abs.htm} } @INPROCEEDINGS{FrFrLa:2003:StEventFM, AUTHOR = {B. Fraikin and Marc Frappier and Régine Laleau}, BOOKTITLE = {State-oriented vs. Event-oriented Thinking in Formal Specification and Software Engineering, satellite workshop of 12th International Symposium Formal Methods 2003, Pisa, Italy}, TITLE = {A Comparison of EB3 and B for Information System Specification.}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {September}, NOTE = {(18 pages)}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{FrLa:2003:ZB, AUTHOR = {Marc Frappier and Régine Laleau}, BOOKTITLE = {ZB 2003: Formal Specification and Development in Z and B, Third International Conference of B and Z Users, Turku, Finland}, TITLE = {Proving Event Ordering Properties for Information Systems.}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {June}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {421-436}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {2651} } @INPROCEEDINGS{Verlan03b, AUTHOR = {Franziska Freund and Rudolf Freund and Marion Oswald and Maurice Margenstern and Yurii Rogozhin and Sergey Verlan}, BOOKTITLE = {Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain, July, 17-22, 2003, Revised Papers}, TITLE = {P Systems with Cutting/Recombination Rules Assigned to Membranes}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Carlos Martìn-Vide and Giancarlo Mauri and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}, MONTH = {July}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {191--202}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {2933}, URL = {http://www.springerlink.com/content/8c5f5lgkdw9ddkr6}, DOI = {10.1007/b95207} } @INPROCEEDINGS{GL2003:ICCS, AUTHOR = {Frédéric Gava and Frédéric Loulergue}, BOOKTITLE = {International Conference on Computational Science (ICCS 2003), Part I}, TITLE = {A Parallel Virtual Machine for Bulk Synchronous Parallel ML}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {P. M. A. Sloot and al.}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {155--164}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {2657}, URL = {http://link.springer.de/link/service/series/0558/bibs/2657/26570155.htm}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_loulergue_iccs_2003.pdf} } @INPROCEEDINGS{GL2003:PACT, AUTHOR = {Frédéric Gava and Frédéric Loulergue}, BOOKTITLE = {Seventh International Conference on Parallel Computing Technologies (PaCT 2003)}, TITLE = {A Polymorphic Type System for Bulk Synchronous Parallel ML}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {V. Malyshkin}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {215--229}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {2763}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_loulergue_pact_2003.pdf} } @INPROCEEDINGS{GL2003:JFLA, AUTHOR = {Frédéric Gava and Frédéric Loulergue}, BOOKTITLE = {Journées Francophones des Langages Applicatifs (JFLA)}, TITLE = {Synthèse de types pour Bulk Synchronous Parallel ML}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {J.C. Filliatre}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {153--168}, PUBLISHER = {INRIA}, SERIES = {Collection Didactique}, OPTVOLUME = {}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_loulergue_jfla_2003.pdf} } @INPROCEEDINGS{GLD2003:SNPD, AUTHOR = {Frédéric Gava and Frédéric Loulergue and Frédéric Dabrowski}, BOOKTITLE = {4th International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'03)}, TITLE = {A Parallel Categorical Abstract Machine for Bulk Synchronous Parallel ML}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {W. Dosch and R. Y. Lee}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {293--300}, PUBLISHER = {ACIS}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://lacl.univ-paris12.fr/gava/papers/gava_loulergue_dabrowski_snpd_2003.pdf} } @INPROCEEDINGS{LOU2003:EUROPAR, AUTHOR = {F. Loulergue}, BOOKTITLE = {Euro-Par 2003}, TITLE = {Parallel Juxtaposition for Bulk Synchronous Parallel ML}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Harald Kosch.et. al}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2790}, OPTORGANIZATION = {}, PAGES = {781-788}, PUBLISHER = {Springer Verlag}, SERIES = {LNCS}, OPTVOLUME = {} } @INPROCEEDINGS{LOU2003:ICSS, AUTHOR = {F. Loulergue}, BOOKTITLE = {International Conference on Computational Science (ICCS 2003), Part III}, TITLE = {Parallel Superposition for Bulk Synchronous Parallel ML}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Peter M. A. Sloot and al.}, MONTH = {june}, OPTNOTE = {}, NUMBER = {2669}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer Verlag}, SERIES = {LNCS}, OPTVOLUME = {} } @INPROCEEDINGS{MaLa:2003:FME, AUTHOR = {Amel Mammar and Régine Laleau}, BOOKTITLE = {FME 2003: Formal Methods, International Symposium of Formal Methods Europe, Pisa, Italy}, TITLE = {Design of an Automatic Prover Dedicated to the Refinement of Database Applications.}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {September}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {834-854}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {2805}, PS = {http://cedric.cnam.fr/PUBLIS/RC346.ps} } @INPROCEEDINGS{Verlan03d, AUTHOR = {Maurice Margenstern and Gheorghe Paun and Yurii Rogozhin and Sergey Verlan}, BOOKTITLE = {Proceedings of DCFS'03, Fifth International Workshop, Descriptional Complexity of Formal Systems, Budapest, Hungary, July 12-14, 2003}, TITLE = {Context-Free Insertion-Deletion Systems}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {E. Csuhaj-Varjú and C. Kintala and D. Wotschke and Gy. Vaszil}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {265--273}, PUBLISHER = {MTA SZTAKI}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{MICHON:2003:HAL-00081341:1, AUTHOR = {Jean-Francis Michon and Pierre Valarcher and Jean-Baptiste Yunès}, BOOKTITLE = {CCC'03}, TITLE = {Analysis of HFE from a BDD point of view}, YEAR = {2003}, ADDRESS = {China}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00081341/en/}, ABSTRACT = {{W}e dealt with the cryptosystem {HFE} which we tried to cryptanalyse using {BDD}.} } @INPROCEEDINGS{pelz03:_compos_high_level_petri_nets_timin_const, AUTHOR = {E. Pelz and H. Fleischhack}, BOOKTITLE = {Proceedings ASCD}, TITLE = {Compositional High Level Petri Nets with Timing Constraints -- a Comparison}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {132-141}, PUBLISHER = {IEEE Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{FORMATS03, AUTHOR = {Franck Pommereau}, BOOKTITLE = {Formal modelling and analysis of timed systems -- FORMATS'03}, TITLE = {Causal Time Calculus}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1-12}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {2791}, URL = {http://hal.archives-ouvertes.fr/hal-00114673/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/11/46/73/PDF/2003-formats.pdf}, ABSTRACT = {We present a process algebra suitable to the modelling of timed concurrent systems and to their efficient verification through model checking. The algebra is provided with two consistent semantics: a structural operational semantics (as usual for process algebras) and a denotational semantics in terms of Petri nets in which time is introduced through counters of explicit clock ticks. This way of modelling time has been called causal time so the process algebra is itself called the Causal Time Calculus (CTC). It was shown in a separate paper that the causal time approach allowed for efficient verification but suffered from a sensitivity to the constants to which counts of ticks are compared. We show in this paper how this weakness can be removed.} } @INPROCEEDINGS{Sliss:2003:CPAISS, AUTHOR = {Anatol Slissenko}, BOOKTITLE = {Proc. of the 2nd Intern. Workshop on Mathematical Methods, Models and Architectures for Computer Networks Security (MMM-ACNS-2003), St.Petersburg, Russia, September 21--23, 2003, Lect. Notes in Comput. Sci, vol. 2776}, TITLE = {Complexity problems in the analysis of information systems security}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {V. Gorodetsky and L. Popyack and V. Skormin}, OPTMONTH = {}, NOTE = {(Invited talk.)}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {48--57}, PUBLISHER = {Springer-Verlag}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{BTK2003:EUROSIS, AUTHOR = {Cécile Bui Thanh and Hanna Klaudel}, BOOKTITLE = {Modelling and Simulation `2003}, TITLE = {Encapsulation in an object-oriented notation based on modular Petri nets}, YEAR = {2003}, ADDRESS = {Naples}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {October}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {508-512}, PUBLISHER = {EUROSIS}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Verlan03e, AUTHOR = {Sergey Verlan}, BOOKTITLE = {Proceedings of DCFS'03, Fifth International Workshop, Descriptional Complexity of Formal Systems, Budapest, Hungary, July 12-14, 2003}, TITLE = {A Frontier Result on Enhanced Time-Varying Distributed H Systems with Parallel Computations}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {E. Csuhaj-Varjú and C. Kintala and D. Wotschke and Gy. Vaszil}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {221--232}, PUBLISHER = {MTA SZTAKI}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Verlan03a, AUTHOR = {Sergey Verlan}, BOOKTITLE = {Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain, July, 17-22, 2003, Revised Papers}, TITLE = {About Splicing P Systems with Immediate Communication and Non-Extended Splicing P Systems}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Carlos Martìn-Vide and Giancarlo Mauri and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}, MONTH = {July}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {369--382}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {2933}, URL = {http://www.springerlink.com/content/r9u1hc93fb3mnlqe}, DOI = {10.1007/b95207} } @INPROCEEDINGS{Verlan03c, AUTHOR = {Sergey Verlan and Rosalba Zizza}, BOOKTITLE = {Proceedings of WORDS'03, 4th International Conference on Combinatorics on Words, September 10-13, 2003, Turku, Finland}, TITLE = {1-splicing vs. 2-splicing: Separating Results}, YEAR = {2003}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {T. Harju and J. Karhumäki}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {320--331}, PUBLISHER = {TUCS General Publication No. 27}, OPTSERIES = {}, OPTVOLUME = {} } @TECHREPORT{lifo2003-05, AUTHOR = {S. Anantharaman and J. Chen and G. Hains and P. Narendran}, INSTITUTION = {LIFO, Laboratoire d'Informatique Fondamentale d'Orléans}, TITLE = {A Synchronous Calculus for Secrecy Analysis}, YEAR = {2003}, ADDRESS = {Université d'Orléans}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {RR-2003-05}, TYPE = {Rapport de Recherche}, PS = {http://www.univ-orleans.fr/SCIENCES/LIFO/prodsci/rapports/RR/RR2003/RR-2003-05.ps.gz} } @TECHREPORT{lifo2003-01, AUTHOR = {S. Anantharaman and G. Hains}, INSTITUTION = {LIFO, Laboratoire d'Informatique Fondamentale d'Orléans}, TITLE = {A Synchronous Bisimulation-Based Approach for Information Flow Analysis}, YEAR = {2003}, ADDRESS = {Université d'Orléans}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {RR-2003-01}, TYPE = {Rapport de Recherche}, URL = {http://www.univ-orleans.fr/SCIENCES/LIFO} } @TECHREPORT{TR-LACL-2003-05, AUTHOR = {A. Barbu and F. Mourlin}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A Higher Order pi-Calculus Specification for a Mobile Agent in JINI}, YEAR = {2003}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2003-05}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2003-05.pdf} } @TECHREPORT{TR-LACL-2003-08, AUTHOR = {D. Beauquier and T. Crolard and E. Prokofieva}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Automatic Parametric Verification of Root Contention Protocol based on Abstract State Machines and First Order Timed Logic}, YEAR = {2003}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2003-08}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2003-08.pdf} } @TECHREPORT{TR-LACL-2003-07, AUTHOR = {D. Beauquier and A. Rabinovich and A. Slissenko}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A logic of probability with decidable model-checking}, YEAR = {2003}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2003-07}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2003-07.pdf} } @TECHREPORT{TR-LACL-2003-06, AUTHOR = {F. Dabrowski}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Pattern Matching and Exceptions Handling for Bulk Synchronous Parallel M}, YEAR = {2003}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2003-06}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2003-06.pdf} } @TECHREPORT{TR-LACL-2003-01, AUTHOR = {F. Gava and F. Loulergue}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A Parallel Virtual Machine for Bulk Synchronous Parallel ML}, YEAR = {2003}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2003-01}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2003-01.pdf} } @TECHREPORT{TR-LACL-2003-02, AUTHOR = {F. Gava and F. Loulergue}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Verifying Functional Bulk Synchronous Parallel Programs Using the Coq System}, YEAR = {2003}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2003-02}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2003-02.pdf} } @TECHREPORT{TR-LACL-2003-09, AUTHOR = {F. Pommereau}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Petri nets as Executable Specifications of High-Level Timed Parallel Systems}, YEAR = {2003}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2003-09}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2003-09.pdf} } @TECHREPORT{TR-LACL-2003-04, AUTHOR = {A. Slissenko}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A Logic Framework for Verification of Timed Distributed Algorithms}, YEAR = {2003}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2003-04}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2003-04.pdf} } @TECHREPORT{TR-LACL-2003-03, AUTHOR = {Cécile Bui Thanh and Hanna Klaudel}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Object-oriented modelling with high-level modular Petri nets}, YEAR = {2003}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2003-03}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2003-03.pdf} } @PHDTHESIS{IGMA_Cer02, AUTHOR = {Julien Cervelle}, SCHOOL = {Université de provence}, TITLE = {Complexité structurelle et algorithmique des pavages et des automates cellulaires}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, NOTE = {Jury: Alain Colmerauer, Marianne Delorme, Bruno Durand2, Enrico Formenti, Jean-yves Marion et Michel Morvan}, TYPE = {Thèse de doctorat}, PDF = {http://igm.univ-mlv.fr/~jcervell/publi/these/these.pdf} } @PHDTHESIS{laleau02:_concep, AUTHOR = {R. Laleau}, SCHOOL = {CEDRIC (CNAM), University of Evry}, TITLE = {Conception et développement formels d'applications bases de données}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, NOTE = {Habilitation à diriger des recherches}, OPTTYPE = {}, PS = {http://cedric.cnam.fr/PUBLIS/RC424.ps.gz} } @PHDTHESIS{pommereau, AUTHOR = {Franck Pommereau}, SCHOOL = {Université Paris 12}, TITLE = {Modèles composables et concurrents pour le temps-réel}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, OPTTYPE = {}, KEYWORDS = {Petri nets, real-time, modelling, verification, composability, concurrency, semantics}, PAGES = {1-178}, ABSTRACT = {This thesis is concerned with the modelling of real-time systems using Petri nets. We investigate both the problem of time representation, and of preemption (i.e., interruption of the processes of a system) which is often needed for real-time applications. We consider Petri nets without explicit temporal information. The key idea of our approach consists in introducing time through specific sub-nets representing clocks present in the system being modelled. This results in what we refer to as causal time since causality is the only means by which the precedence relationship between event occurrences is specified. For a succinct formulation of the causal time model, we use M-nets which are a class of coloured Petri nets endowed with compositional operators similar to those used by the standard process algebras. We extend the M-nets model in order to allow an efficient representation of asynchronous interprocess communication, and establish a number of theoretical results concerning such an extension. We use the resulting M-nets to model several clocks with varied characteristics, showing how they can be synchronised or kept independent. The suitability of the proposed approach is evaluated using a case study, and it is then used to give a semantics of the parallel programming language B(PN)² extended with real-time constructs. In order to deal with preemption, we propose another extension of the M-nets model supporting operators for process suspension/resuming and abortion. The resulting model is investigated at the theoretical level, and applied to B(PN)² enhanced with exceptions and tasks.} } @INBOOK{cmpp2000book-bspcp, PUBLISHER = {Nova Science Books and Journals}, TITLE = {BSP Constraint Programming}, YEAR = {2002}, AUTHOR = {O. Ballereau and G. Hains and A. Lallouet}, CHAPTER = {7}, ALTEDITOR = {}, PAGES = {95-111}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, SERIES = {Advances in Computation: Theory and Practice}, OPTTYPE = {}, OPTVOLUME = {}, BOOKTITLE = {Constructive Methods for Parallel Programming} } @INBOOK{autran02, PUBLISHER = {Hermes}, TITLE = {Modelling and Simulation of biological processes in the context of genomics}, YEAR = {2002}, AUTHOR = {Jean-Louis Giavitto and C. Godin and Olivier Michel and P. Prusinkiewicz}, CHAPTER = {``Computational Models for Integrative and Developmental Biology''}, ALTEDITOR = {}, ALTPAGES = {}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITION = {}, MONTH = {July}, NOTE = {Also republished as an high-level course in the proceedings of the Dieppe spring school on ``Modelling and simulation of biological processes in the context of genomics'', 12-17 may 2003, Dieppes, France.}, OPTNUMBER = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/2002/autran02.ps.gz} } @INBOOK{cmpp2000book-bsml, PUBLISHER = {Nova Science Publishers}, TITLE = {Functional Bulk Synchronous Parallel Programming using the BSMLlib Library}, YEAR = {2002}, AUTHOR = {G. Hains and F. Loulergue}, CHAPTER = {11}, EDITOR = {Sergei Gorlatch and Christian Lengauer}, PAGES = {165-178}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTMONTH = {}, NOTE = {first appeared in CMPP'2000 Second International Workshop on Constructive Methods for Parallel Programming, Technical Report MIP-0007, Fakultät für Mathematik und Informatik, Univ. Passau, Germany}, OPTNUMBER = {}, SERIES = {Advances in Computation: Theory and Practice}, OPTTYPE = {}, OPTVOLUME = {}, BOOKTITLE = {Constructive Methods for Parallel Programming} } @INCOLLECTION{bes02b, AUTHOR = {A. Bès}, BOOKTITLE = {A tribute to Maurice Boffa}, PUBLISHER = {Soc. Math. Belgique}, TITLE = {A survey of arithmetical definability}, YEAR = {2002}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {1--54}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @ARTICLE{norris02, AUTHOR = {Patrick Amar and Pascal Ballet and Georgia Barlovatz-Meimon and Arndt Benecke and Gilles Bernot and Yves Bouligand and Paul Bourguine and Franck Delaplace and Jean-Marc Delosme and Maurice Demarty and Itzhak Fishov and Jean Fourmentin-Guilbert and Joe Fralick and Jean-Louis Giavitto and Bernard Gleyse and Christophe Godin and Roberto Incitti and François Képès and Catherine Lange and Lois Le Sceller and Corinne Loutellier and Olivier Michel and Franck Molina and Chantal Monnier and René Natowicz and Vic Norris and Nicole Orange and Helene Pollard and Derek Raine and Camille Ripoll and Josette Rouviere-Yaniv and Milton Saier and Paul Soler and Pierre Tambourin and Michel Thellier and Philippe Tracqui and Dave Ussery and Jean-Claude Vincent and Jean-Pierre Vannier and Philippa Wiggins and Abdallah Zemirline}, JOURNAL = {Acta Biotheoretica}, TITLE = {Hyperstructures, genome analysis and I-cells}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {357--373}, VOLUME = {50}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2002/Hyperstructures.pdf} } @ARTICLE{Bea02, AUTHOR = {D. Beauquier}, JOURNAL = {Fundamenta Informaticae}, TITLE = {Markov decision processes and deterministic Büchi automata}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {1--13}, VOLUME = {49} } @ARTICLE{Bea02b, AUTHOR = {D. Beauquier and J.C. Fournier}, JOURNAL = {Theoretical Computer Science}, TITLE = {Groups and tilings}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {81-98}, OPTVOLUME = {} } @ARTICLE{BR02, AUTHOR = {D. Beauquier and A. Rabinovich}, JOURNAL = {Journal of Logic and Computation}, TITLE = {Monadic Logic of Order over Naturals has no Finite Base}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {243-253}, VOLUME = {12} } @ARTICLE{BHRS:2002:PNG, AUTHOR = {Danièle Beauquier and A. Rabinovich and Y. Hirshfeld and Anatol Slissenko}, JOURNAL = {Electronic Notes in Theoretical Computer Science}, TITLE = {The probability nesting game}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, OPTPAGES = {}, VOLUME = {68} } @ARTICLE{BeauSliss:2002:FOLS, AUTHOR = {Danièle Beauquier and Anatol Slissenko}, JOURNAL = {Annals of Pure and Applied Logic}, TITLE = {A First Order Logic for Specification of Timed Algorithms: Basic Properties and a Decidable Class}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1--3}, PAGES = {13--52}, VOLUME = {113} } @ARTICLE{BeaSli:2002:DVRTA, AUTHOR = {Danièle Beauquier and Anatol Slissenko}, JOURNAL = {Theoretical Computer Science}, TITLE = {Decidable verification for reducible timed automata specified in a first order logic with time}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1--2}, PAGES = {347--388}, VOLUME = {275}, URL = {http://www.elsevier.com/gej-ng/10/41/16/246/27/37/abstract.html} } @ARTICLE{DBLP:journals/order/BertetC02, AUTHOR = {Karell Bertet and Nathalie Caspard}, JOURNAL = {Order}, TITLE = {Doubling Convex Sets in Lattices: Characterizations and Recognition Algorithms}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {181-207}, VOLUME = {19}, DOI = {10.1023/A:1016524118566} } @ARTICLE{bes02a, AUTHOR = {A. Bès}, JOURNAL = {Fundamenta Mathematicae}, TITLE = {Decidability and definability results related to the elementary theory of ordinal multiplication}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {197--211}, VOLUME = {171} } @ARTICLE{DBLP:journals/tcs/Carbone02, AUTHOR = {Alessandra Carbone}, JOURNAL = {Theor. Comput. Sci.}, TITLE = {Streams and strings in formal proofs}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {45-83}, VOLUME = {288} } @ARTICLE{DBLP:journals/jsyml/Carbone02, AUTHOR = {Alessandra Carbone}, JOURNAL = {J. Symb. Log.}, TITLE = {The Cost of A Cycle Is A Square}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {35-60}, VOLUME = {67} } @ARTICLE{Dima:2002:hun, AUTHOR = {Catalin Dima}, JOURNAL = {Publicationes Mathematicae Univ. Debrecen}, TITLE = {Automata and Regular Expressions for Real-Time Languages}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {523--538}, VOLUME = {60} } @ARTICLE{DBLP:journals/iandc/Durand02, AUTHOR = {Arnaud Durand}, JOURNAL = {Inf. Comput.}, TITLE = {Linear Time and the Power of One First-Order Universal Quantifier}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {12-22}, VOLUME = {178}, DOI = {10.1006/inco.2002.3027} } @ARTICLE{DBLP:journals/tcs/DurandHJ02, AUTHOR = {Arnaud Durand and Miki Hermann and Laurent Juban}, JOURNAL = {Theor. Comput. Sci.}, TITLE = {On the complexity of recognizing the Hilbert basis of a linear diophantine system}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1-2}, PAGES = {625-642}, VOLUME = {270}, URL = {http://hal.inria.fr/inria-00098956/en/}, DOI = {10.1016/S0304-3975(01)00017-2} } @ARTICLE{DBLP:journals/iandc/DurandM02, AUTHOR = {Arnaud Durand and Malika More}, JOURNAL = {Inf. Comput.}, TITLE = {Nonerasing, Counting, and Majority over the Linear Time Hierarchy}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {132-142}, VOLUME = {174}, DOI = {10.1006/inco.2001.3084} } @ARTICLE{giavitto02a, AUTHOR = {Jean-Louis Giavitto and Olivier Michel}, JOURNAL = {Fundamenta Informaticae}, TITLE = {The Topological Structures of Membrane Computing}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {107--129}, VOLUME = {49}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2002/mgs-giavitto-michel-fundamenta-informaticae.pdf} } @ARTICLE{giavitto03b, AUTHOR = {Jean-Louis Giavitto and Olivier Michel and Julien Cohenn}, JOURNAL = {ACM SIGPLAN Notices}, TITLE = {Pattern-matching and Rewriting Rules for Group Indexed Data Structures}, YEAR = {2002}, MONTH = {December}, OPTNOTE = {}, NUMBER = {12}, PAGES = {76--87}, VOLUME = {37}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2003/sigplan03.pdf}, ABSTRACT = { In this paper, we present a new framework for the definition of various data structures (including trees and arrays) together with a generic language of filters enabling a rule-based programming style for functions. This framework is implemented in an experimental language called \MGS. The underlying notions funding our framework have a topological nature and enable to extend the case-based definition of functions found in modern functional languages beyond algebraic data structures.} } @ARTICLE{FI02, AUTHOR = {Hanna Klaudel and Franck Pommereau}, JOURNAL = {Fundamenta Informaticae}, TITLE = {A class of composable and preemptible high-level Petri nets with an application to multi-tasking systems.}, YEAR = {2002}, MONTH = {03}, OPTNOTE = {}, NUMBER = {1}, PAGES = {33-55}, VOLUME = {50}, KEYWORDS = {Petri nets, compositionality, preemption, tasks}, PUBLISHER = {IOS Press}, URL = {http://hal.archives-ouvertes.fr/hal-00114685/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/11/46/85/PDF/2002-fi.pdf }, ABSTRACT = {This paper presents an extension of an algebra of high-level Petri nets with operations for suspension and abortion. These operations are sound with respect to the semantics of preemption, and can be applied to the modelling of the semantics of high-level parallel programming languages with preemption-related features. As an illustration, the paper gives an application to the modelling of a multi-tasking system in a parallel programming language, which is provided with a concurrent semantics based on Petri nets and for which implemented tools can be used.} } @ARTICLE{Pekergin:CC02, AUTHOR = {Mouad Ben Mamoun and Nihal Pekergin}, JOURNAL = {Probability in the Engineering and Informational Sciences}, TITLE = {Closed-form stochastic bounds on the stationary distribution of Markov chains}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {403--426}, VOLUME = {16}, PUBLISHER = {Cambridge University Press} } @ARTICLE{DBLP:journals/pe/MamounP02, AUTHOR = {Mouad Ben Mamoun and Nihal Pekergin}, JOURNAL = {Performance Evaluation}, TITLE = {Stochastic delay bounds of fair queuing policies by analyzing weighted round robin-related policies}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2/3}, PAGES = {181-196}, VOLUME = {47}, PUBLISHER = {Elsevier} } @ARTICLE{DBLP:journals/ijcm/TipleaME02, AUTHOR = {Ferucio Laurentiu Tiplea and Erkki Mäkinen and Constantin Enea}, JOURNAL = {Int. J. Comput. Math.}, TITLE = {SE-Systems, Timing Mechanisms, and Time-Varying Codes}, YEAR = {2002}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {10}, PAGES = {1083-1091}, VOLUME = {79}, URL = {http://taylorandfrancis.metapress.com/openurl.asp?genre=article&issn=0020-7160&volume=79&issue=10&spage=1083} } @ARTICLE{Verlan02a, AUTHOR = {Sergey Verlan}, JOURNAL = {Computer Science Journal of Moldova}, TITLE = {On Enhanced Time-Varying Distributed H Systems}, YEAR = {2002}, OPTMONTH = {}, NOTE = {Kishinev}, NUMBER = {3}, PAGES = {263-279}, VOLUME = {10} } @INPROCEEDINGS{AsDi:2002:entcs, AUTHOR = {E. Asarin and Catalin Dima}, BOOKTITLE = {3rd Workshop on Models for Time-Critical Systems (MTCS), Workshops of CONCUR}, TITLE = {Balanced timed regular expressions}, YEAR = {2002}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1--18}, OPTPUBLISHER = {}, SERIES = {Electronic Notes in Theoretical Computer Science}, VOLUME = {68} } @INPROCEEDINGS{BM2002:EURASIA, AUTHOR = {A. Barbu and F. Mourlin}, BOOKTITLE = {EurAsia ICT 2002, Workshop on Language, Software and Data Engineering}, TITLE = {Mobile Properties and Temporal Logic}, YEAR = {2002}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Austrian Computer Society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{BeRaSl:2002:LPDMC, AUTHOR = {Danièle Beauquier and A. Rabinovich and Anatol Slissenko}, BOOKTITLE = {Proc. of the 16th Int. Worksshop. on Comput. Sci. Logic (CSL'02) and 11th Annual Conference of the EACSL , September 22--25, 2002, Edinburgh, UK. Lect. Notes in Comput. Sci., vol. 2471}, TITLE = {A logic of probability with decidable model-checking}, YEAR = {2002}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {J. Bradfield}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {306--321}, PUBLISHER = {Springer-Verlag}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/mascots/BenmammounFPT02, AUTHOR = {M. Benmammoun and Jean-Michel Fourneau and Nihal Pekergin and Alexis Troubnikoff}, BOOKTITLE = {10th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)}, TITLE = {An Algorithmic and Numerical Approach to Bound the Performance of High Speed Networks}, YEAR = {2002}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {375-382}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://csdl.computer.org/comp/proceedings/mascots/2002/1840/00/18400375abs.htm} } @INPROCEEDINGS{HPC02, AUTHOR = {Raymond Devillers and Hanna Klaudel and Maciej Koutny and Elisabeth Pelz and Franck Pommereau}, BOOKTITLE = {High Performance Computing}, TITLE = {Operational Semantics for PBC with Asynchronous Communication}, YEAR = {2002}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1-6}, PUBLISHER = {SCS}, OPTSERIES = {}, OPTVOLUME = {}, KEYWORDS = {Petri nets, process algebra, asynchronous communication, structured operational semantics}, URL = {http://hal.archives-ouvertes.fr/hal-00114684/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/11/46/84/PDF/2002-hpc.pdf }, ABSTRACT = {This paper presents two related algebras which can be used to specify and analyse concurrent systems with synchronous and asynchronous communications. The first algebra is based on a class of P/T-nets, called boxes, and their standard transition firing rule. It is an extension of the Petri Box Calculus (PBC). Essentially, the original model is enriched with the introduction of special _buffer_ places where different transitions (processes) may deposit and remove tokens, together with an explicit asynchronous communication operator, denoted by tie, allowing to make them _private_. We also introduce an algebra of process expressions corresponding to such a net algebra, by augmenting the existing syntax of PBC expressions, and defining a system of SOS rules providing their operational semantics. The two algebras are related through a mapping which, for any extended box expression, returns a corresponding box with an isomorphic transition system.} } @INPROCEEDINGS{Dima:2002:lics, AUTHOR = {Catalin Dima}, BOOKTITLE = {Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS'02)}, TITLE = {Computing reachability relations in timed automata}, YEAR = {2002}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {177-186}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DFP:TCS:02, AUTHOR = {Marie Duflot and Laurent Fribourg and Claudine Picaronny}, BOOKTITLE = {Proc. 2nd IFIP Int. Conf. on Theoretical Computer Science (TCS@02)}, TITLE = {Randomized dining philosophers without fairness assumption}, YEAR = {2002}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {169--180}, PUBLISHER = {Kluwer Academic}, SERIES = {IFIP Conference Proceedings}, VOLUME = {223} } @INPROCEEDINGS{DBLP:conf/performance/FourneauP02, AUTHOR = {Jean-Michel Fourneau and Nihal Pekergin}, BOOKTITLE = {Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures}, TITLE = {An Algorithmic Approach to Stochastic Bounds}, YEAR = {2002}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Mariacarla Calzarossa and Salvatore Tucci}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {64-88}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {2459}, URL = {http://link.springer.de/link/service/series/0558/bibs/2459/24590064.htm} } @INPROCEEDINGS{giavitto02b, AUTHOR = {J.-L. Giavitto and Olivier Michel}, BOOKTITLE = {Pre-proceedings of WMC-CdeA 2002 (Workshop on Membrane Computing, Curtea de Arges)}, TITLE = {Accretive rules in Cayley P systems}, YEAR = {2002}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {August}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {MolCoNet european network 2002-1}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2002/wmc02.pdf} } @INPROCEEDINGS{giavitto02d, AUTHOR = {Jean-Louis Giavitto and Olivier Michel}, BOOKTITLE = {Proceedings of the 3nd International Conference on Unconventional Models of Computation UMC02}, TITLE = {Data Structure as Topological Spaces}, YEAR = {2002}, ADDRESS = {Himeji, Japan}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {October}, NOTE = {Lecture Notes in Computer Science}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {137--150}, OPTPUBLISHER = {}, OPTSERIES = {}, VOLUME = {2509}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2002/umc02.pdf } } @INPROCEEDINGS{giavitto02f, AUTHOR = {Jean-Louis Giavitto and Olivier Michel}, BOOKTITLE = {ACM Sigplan Workshop RULE'02}, TITLE = {Pattern-matching and Rewriting Rules for Group Indexed Data Structures}, YEAR = {2002}, ADDRESS = {Pittsburgh}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {October}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {55--66}, PUBLISHER = {ACM}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2002/rule02.pdf} } @INPROCEEDINGS{pdcs2002, AUTHOR = {G. Hains and M. Bergeron}, BOOKTITLE = {International Conference on Parallel and Distributed Computer Systems}, TITLE = {The BNAI Analyzer: A Tool for Verifying Admissible Information Flow in Protocols}, YEAR = {2002}, ADDRESS = {Cambridge MA, USA}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {November}, OPTNOTE = {}, OPTNUMBER = {}, ORGANIZATION = {IASTED}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{laleau02:_comin_uml_b, AUTHOR = {R. Laleau and F. Polack}, BOOKTITLE = {ZB'2002: International Conference on Formal Specification and Development in Z and B}, TITLE = {Coming and going from UML to B : a proposal to support traceability in rigorous IS development}, YEAR = {2002}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, OPTVOLUME = {}, PS = {http://cedric.cnam.fr/PUBLIS/RC393.ps.gz} } @INPROCEEDINGS{LOU2002:PDCS, AUTHOR = {F. Loulergue}, BOOKTITLE = {$14^{\text{th}}$ IASTED International Conference on Parallel and Distributed Computing Systems}, TITLE = {Implementation of a Functional Bulk Synchronous Parallel Programming Library}, YEAR = {2002}, ADDRESS = {Cambridge, USA}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {November}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {452--457}, PUBLISHER = {ACTA Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/iis/LyaletskiVDP02, AUTHOR = {Alexander V. Lyaletski and Konstantin Verchinine and Anatoli Degtyarev and Andrey Paskevich}, BOOKTITLE = {Intelligent Information Systems 2002, Proceedings of the IIS'2002 Symposium, Sopot, Poland, June 3-6, 2002}, TITLE = {System for Automated Deduction (SAD): Linguistic and Deductive Peculiarities}, YEAR = {2002}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Mieczyslaw A. Klopotek and Slawomir T. Wierzchon and Maciej Michalewicz}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {413-422}, PUBLISHER = {Physica-Verlag}, SERIES = {Advances in Soft Computing}, OPTVOLUME = {} } @INPROCEEDINGS{Verlan02b, AUTHOR = {Maurice Margenstern and Yurii Rogozhin and Sergey Verlan}, BOOKTITLE = {DNA Computing: 8th International Workshop on DNA-Based Computers, DNA8, Sapporo, Japan, June 10-13, 2002. Revised Papers}, TITLE = {Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations}, YEAR = {2002}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {M. Hagiya and A. Ohuchi}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, ORGANIZATION = {Hokkaido University}, PAGES = {326--336}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {2568}, DOI = {10.1007/3-540-36440-4_29} } @INPROCEEDINGS{jfla2002, AUTHOR = {A. Merlin and G. Hains}, BOOKTITLE = {Journées Francophones des Langages Applicatifs (JFLA2002)}, TITLE = {La Machine Abstraite Catégorique BSP}, YEAR = {2002}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {L. Rideau}, MONTH = {Janvier}, NOTE = {ISBN 2-7261-1197-1}, OPTNUMBER = {}, ORGANIZATION = {INRIA}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{giavitto02c, AUTHOR = {Olivier Michel and Jean-Louis Giavitto and Julien Cohenn}, BOOKTITLE = {Journées Francophones des Langages Applicatifs (JFLA02)}, TITLE = {MGS : transformer des collections complexes pour la simulation en biologie}, YEAR = {2002}, ADDRESS = {Anglet (France)}, OPTCROSSREF = {}, EDITOR = {L. Rideau}, MONTH = {January}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {INRIA}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/2002/JFLA02.ps.gz} } @INPROCEEDINGS{BTS2002:TOOLS, AUTHOR = {Cécile Bui Thanh and Ch. Stehno}, BOOKTITLE = {TOOLS DAY}, TITLE = {New Petri Net Programming Features in PEP}, YEAR = {2002}, ADDRESS = {Brno, Czech Republic}, OPTCROSSREF = {}, EDITOR = {Ivana Cerna}, MONTH = {August}, OPTNOTE = {}, NUMBER = {FIMU-RS-2002-05}, ORGANIZATION = {Faculty of Informatics, Masaryk University}, PAGES = {72--78}, OPTPUBLISHER = {}, SERIES = {FI MU Report Series}, OPTVOLUME = {} } @TECHREPORT{TR-LACL-2002-06, AUTHOR = {A. Barbu and F. Mourlin}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Mobile properties and Temporal Logic}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-06}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-06.pdf} } @TECHREPORT{TR-LACL-2002-01, AUTHOR = {Danièle Beauquier}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Markov Decision Processes and Deterministic Büchi Automata}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-01}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-01.pdf} } @TECHREPORT{TR-LACL-2002-04, AUTHOR = {D. Beauquier and A. Rabinovich and A. Slissenko}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A logic of probability with decidable model-checking}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-04}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-04.pdf} } @TECHREPORT{TR-LACL-2002-08, AUTHOR = {K. Bertet and N. Caspard}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Doubling convec sets in lattices: characterizations and recognition algorithms}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-08}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-08.pdf} } @TECHREPORT{blazy02:_un_b, AUTHOR = {S. Blazy and F. Gervais and R. Laleau}, INSTITUTION = {CEDRIC (CNAM)}, TITLE = {Un exemple de réutilisation de patterns de spécification avec la méthode B}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {395}, OPTTYPE = {}, PDF = {http://cedric.cnam.fr/PUBLIS/RC395.pdf} } @TECHREPORT{TR-LACL-2002-07, AUTHOR = {N. Caspard and M. Morvan}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A note on finite distributive lattices generated by a given set of doubly irreducible elements}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-07}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-07.pdf} } @TECHREPORT{TR-LACL-2002-09, AUTHOR = {N. Caspard and de Poly-Barbut, C. LeConte and M. Morvan}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Coxeter lattices are bounded}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-09}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-09.pdf} } @TECHREPORT{TR-LACL-2002-03, AUTHOR = {Joëlle Cohen and A. Slissenko}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {On Refinements of Real-Time Distributed Abstract State Machines}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-03}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-03.pdf} } @TECHREPORT{TR-LACL-2002-02, AUTHOR = {Tristan Crolard}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A Constructive Restriction of the lambda-mu-calculus}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-02}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-02.pdf} } @TECHREPORT{TR-LACL-2002-10, AUTHOR = {F. Dabrowski and F. Loulergue}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Efficiency of Bulk Synchronous Parallel Programming using C++, BSCF++ and BSMLlib}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-10}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-10.pdf} } @TECHREPORT{TR-LACL-2002-13, AUTHOR = {F. Dabrowski and F. Loulergue}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Functional Bulk Synchronous Parallel Programming in C++}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-13}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-13.pdf} } @TECHREPORT{TR-LACL-2002-18, AUTHOR = {H. Fleischhack and E. Pelz}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {High Level Branching Processes for High Level Petri Nets}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-18}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-18.pdf} } @TECHREPORT{TR-LACL-2002-12, AUTHOR = {Frédéric Gava}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A Polymorphic Type System for BSML}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-12}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-12.pd} } @TECHREPORT{TR-LACL-2002-20, AUTHOR = {F. Gava and F. Loulergue}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A Parallel Categorical Abstract Machine for Bulk Synchronous Parallel ML}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-20}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-20.pdf} } @TECHREPORT{TR-LACL-2002-14, AUTHOR = {F. Gava and F. Loulergue}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Semantics of a Functional Bulk Synchronous Parallel Language with Imperative Features}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-14}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-14.pdf} } @TECHREPORT{giavitto02R1, AUTHOR = {Jean-Louis Giavitto and C. Godin and Olivier Michel and P. Prusinkiewicz}, INSTITUTION = {LaMI -- Université d'Évry Val d'Essonne}, TITLE = {Computational Models for Integrative and Developmental Biology}, YEAR = {2002}, OPTADDRESS = {}, MONTH = {March}, OPTNOTE = {}, NUMBER = {72-2002}, OPTTYPE = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2002/rt72.pdf} } @TECHREPORT{giavitto02R2, AUTHOR = {Jean-Louis Giavitto and Olivier Michel and Julien Cohenn}, INSTITUTION = {LaMI -- Université d'Évry Val d'Essonne}, TITLE = {Pattern-matching and Rewriting Rules for Group Indexed Data Structures}, YEAR = {2002}, OPTADDRESS = {}, MONTH = {June}, OPTNOTE = {}, NUMBER = {76-2002}, OPTTYPE = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2002/rt76.pdf } } @TECHREPORT{TR-LACL-2002-19, AUTHOR = { H.Fleischhack and E.Pelz}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Hierarchical Timed High Level Nets and their Branching Processes}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-19}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-19.pdf} } @TECHREPORT{TR-LACL-2002-21, AUTHOR = {F. Loulergue}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Compositionality in Functional Bulk Synchronous Parallelism}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-21}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-21.pdf} } @TECHREPORT{TR-LACL-2002-11, AUTHOR = {Frédéric Loulergue}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Implementation of the BSMLlib Library v0.2}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-11}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-11.pdf} } @TECHREPORT{TR-LACL-2002-17, AUTHOR = {F. Loulergue}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Parallel Juxtaposition for Bulk Synchronous Parallel ML}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-17}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-17.pdf} } @TECHREPORT{TR-LACL-2002-22, AUTHOR = {F. Pommereau}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Causal Time Calculus}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-22}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-22.pd} } @TECHREPORT{TR-LACL-2002-15, AUTHOR = {J. Skaita and F. Mourlin}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A mobile approach for the intrusion detection}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-15}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-15.pdf} } @TECHREPORT{TR-LACL-2002-16, AUTHOR = {C. Bui Thanh and H. Klaudel and F. Pommereau}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Asynchronous Box Calculus with Multi-way Communication}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-16}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-16.pdf} } @TECHREPORT{TR-LACL-2002-23, AUTHOR = {C. Bui Thanh and H. Klaudel and F. Pommereau}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Box Calculus with Coloured Buffers}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2002-23}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2002-23.pdf} } @MANUAL{tutorielMGS, TITLE = {Une présentation du langage MGS}, OPTADDRESS = {}, AUTHOR = {Jean-Louis Giavitto and Olivier Michel and Julien Cohenn}, OPTEDITION = {}, MONTH = {May}, NOTE = {(tutoriel)}, ORGANIZATION = {LaMI, université d'Evry}, YEAR = {2002} } @MASTERSTHESIS{GAVA2002:MASTER, AUTHOR = {Frédéric Gava}, SCHOOL = {University Paris XII-Val de Marne}, TITLE = {A Polymorphic Type System for BSML}, YEAR = {2002}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/gava/papers/masterthese_gava.pdf} } @MISC{Crolard98b, AUTHOR = {T. Crolard}, HOWPUBLISHED = {To submit}, OPTMONTH = {}, OPTNOTE = {}, TITLE = {A Constructive Restriction of the $\lambda\mu$-calculus}, YEAR = {2002} } @PROCEEDINGS{hlpp2001, TITLE = {High-Level Parallel Programming and Applications}, YEAR = {2001}, OPTADDRESS = {}, EDITOR = {G. Hains and Q. Miller}, MONTH = {December}, NOTE = {Selected papers from HLPP2001, Orléans, March 2001.}, NUMBER = {4}, ORGANIZATION = {Parallel Processing Letters (World Scientific)}, OPTPUBLISHER = {}, OPTSERIES = {}, VOLUME = {11}, BOOKTITLE = {High-Level Parallel Programming and Applications} } @INCOLLECTION{LOU2001:SFPBOOK, AUTHOR = {F. Loulergue}, BOOKTITLE = {Trends in Functional Programming, Volume 2}, PUBLISHER = {Intellect Books}, TITLE = {Parallel Composition and Bulk Synchronous Parallel Functional Programming}, YEAR = {2001}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {S. Gilmore}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {77-88}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @ARTICLE{AFP01, AUTHOR = {Oula Abuamsha and Jean-Michel Fourneau and Nihal Pekergin}, JOURNAL = {Calculateurs Paralléles, Réseaux et Systémes Répartis}, TITLE = {Bornes stochastiques pour les taux de pertes dans un tampon mémoire ATM}, YEAR = {2001}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {6}, PAGES = {533-557}, VOLUME = {13} } @ARTICLE{Crolard98, AUTHOR = {T. Crolard}, JOURNAL = {Theoretical Computer Science}, TITLE = {Subtractive Logic}, YEAR = {2001}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1--2}, PAGES = {151--185}, VOLUME = {254} } @ARTICLE{HLM:TCS2001, AUTHOR = {G. Hains and F. Loulergue and J. Mullins}, JOURNAL = {Theoretical Computer Science}, TITLE = {Concrete Data Structures and Functional Parallel Programming}, YEAR = {2001}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1--2}, PAGES = {233--267}, VOLUME = {258} } @ARTICLE{hk-scp, AUTHOR = {Hanna Klaudel}, JOURNAL = {Science of Computer Programming}, TITLE = {Compositional High-Level Petri Net Semantics of a Parallel Programming Language with Procedures}, YEAR = {2001}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTPAGES = {}, VOLUME = {41} } @ARTICLE{laleau01:_specif_uml, AUTHOR = {R. Laleau and F. Polack}, JOURNAL = {Information and Software Technology}, TITLE = {Specification of integrity-preserving operations in information systems by using a formal UML-based language}, YEAR = {2001}, OPTMONTH = {}, NOTE = {Elsevier, M. Dyer and M. Shepperd eds}, NUMBER = {0}, OPTPAGES = {}, VOLUME = {0}, PS = {http://cedric.cnam.fr/PUBLIS/RC275.ps.gz} } @ARTICLE{LOU2001:PPL, AUTHOR = {F. Loulergue}, JOURNAL = {Parallel Processing Letters}, TITLE = {Distributed Evaluation of Functional BSP Programs}, YEAR = {2001}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {423--437}, OPTVOLUME = {} } @ARTICLE{SchSli:2001:ASM01, AUTHOR = {W. Schulte and Anatol Slissenko}, JOURNAL = {Bulletin of EATCS}, TITLE = {ASM2001: Abstract State Machine International Workshop}, YEAR = {2001}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {74}, PAGES = {246--248}, OPTVOLUME = {} } @INPROCEEDINGS{BeCrDuSl:2001:IERTGC, AUTHOR = {Danièle Beauquier and T. Crolard and A. Durand and Anatol Slissenko}, BOOKTITLE = {Proc. of the 3nd International Conf. on Computer Science and Information Technologies, September 17--22, 2001, Yerevan, Armenia}, TITLE = {Impossibility of `Essential' Real-Time Garbage Collection in the General Case}, YEAR = {2001}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {113--117}, PUBLISHER = {National Academy of Sciences of Armenia}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{IGMA_CerDurFor01, AUTHOR = {Julien Cervelle and Bruno Durand and Enrico Formenti}, BOOKTITLE = {26th International Symposium on Mathematical Foundations of Computer Science (MFCS'01)}, TITLE = {Algorithmic Information Theory and Cellular Automata Dynamics}, YEAR = {2001}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Jiri Sgall and Ales Pultr and Petr Kolman}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {248--259}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {2136}, PDF = {http://igm.univ-mlv.fr/~jcervell/publi/AIT%20and%20CA%20dynamics/AIT%20and%20CA%20dynamics.pdf} } @INPROCEEDINGS{CoheSlis:2001:RTASM, AUTHOR = {Joëlle Cohen and Anatol Slissenko}, BOOKTITLE = {Formal Methods and Tools for Computer Science, EUROCAST 2001, Extended Abstracts, Las Palmas de Gran Canaria, February 19--23, 2001}, TITLE = {On Refinements of Timed Abstract State Machines}, YEAR = {2001}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {R. Moreno-D$\acute\i$az and A. Quesada-Arencibia}, OPTMONTH = {}, NOTE = {ISBN 84-699-3971-8.}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {247--250}, PUBLISHER = {20001 IUCTC Universidad de Las Palmas de Gran Canaria}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DFN:Concur:01, AUTHOR = {Marie Duflot and Laurent Fribourg and Ulf Nilsson}, BOOKTITLE = {Proc. 12th Int. Conf. on Concurrency Theory (CONCUR'01)}, TITLE = {Unavoidable Configurations of Parameterized Rings of Processes}, YEAR = {2001}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {472--486}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {2154} } @INPROCEEDINGS{DFP:Disc:01, AUTHOR = {Marie Duflot and Laurent Fribourg and Claudine Picaronny}, BOOKTITLE = {Proc. 15th Int. Conf. on Distributed Computing (DISC'01)}, TITLE = {Randomized Finite-state Distributed Algorithms as Markov chains}, YEAR = {2001}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {240--254}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {2180} } @INPROCEEDINGS{giavitto01c, AUTHOR = {Jean-Louis Giavitto and Olivier Michel}, BOOKTITLE = {PPDP '01: Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming}, TITLE = {Declarative definition of group indexed data structures and approximation of their domains}, YEAR = {2001}, ADDRESS = {New York, NY, USA}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {150--161}, PUBLISHER = {ACM Press}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2001/ppdp01.pdf}, DOI = {http://doi.acm.org/10.1145/773184.773201} } @INPROCEEDINGS{giavitto01d, AUTHOR = {J.-L. Giavitto and Olivier Michel}, BOOKTITLE = {Pre-proceedings of WMC-CdeA 2001 (Workshop on Membrane Computing, Curtea de Arges)}, TITLE = {MGS: Implementing a Unified View on Four Biologically Inspired Computational Models}, YEAR = {2001}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {August}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Research Report 17/01 of the Universitat Rivira I Virgili, Tarragona, Spain}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/2001/wmc01.ps.gz} } @INPROCEEDINGS{giavitto01b, AUTHOR = {Jean-Louis Giavitto and Olivier Michel}, BOOKTITLE = {Electronic Notes in Theoretical Computer Science}, TITLE = {MGS: a Rule-Based Programming Language for Complex Objects and Collections}, YEAR = {2001}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {van den Brand, Mark and Rakesh Verma}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Elsevier Science Publishers}, OPTSERIES = {}, VOLUME = {59}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/2001/entcs01.pdf } } @INPROCEEDINGS{giavitto01e, AUTHOR = {J.-L. Giavitto and Olivier Michel and F. Delaplace}, BOOKTITLE = {Proceedings of IPCAT 2001 (Workshop on Information Processing in Cells and Tissues)}, TITLE = {Declarative simulation of dynamicals systems : the $8 1/2$ programming language and its application to the simulation of genetic networks}, YEAR = {2001}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {August}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/2001/ipcat.ps.gz } } @INPROCEEDINGS{DBLP:conf/webeng/Gnaho01, AUTHOR = {Christophe Gnaho}, BOOKTITLE = {Web Engineering, Software Engineering and Web Application Development}, TITLE = {Web-Based Information Systems Development - A User Centered Engineering Approach}, YEAR = {2001}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {San Murugesan and Yogesh Deshpande}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {105-118}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {2016}, URL = {http://link.springer.de/link/service/series/0558/bibs/2016/20160105.htm} } @INPROCEEDINGS{ICATPN01, AUTHOR = {Hanna Klaudel and Franck Pommereau}, BOOKTITLE = {Applications and theory of Petri nets}, TITLE = {A concurrent semantics of static exceptions in a parallel programming language}, YEAR = {2001}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {J.-M. Colom and M. Koutny}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {204-223}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {2075}, KEYWORDS = {Exceptions, Petri nets, semantics, parallel programming}, URL = {http://hal.archives-ouvertes.fr/hal-00114689/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/11/46/89/PDF/2001-icatpn.pdf }, ABSTRACT = {This paper aims at introducing a mechanism of exceptions in a parallel programming language, giving them a formal concurrent semantics in terms of preemptible and composable high-level Petri nets. We show that, combined with concurrency, exceptions can be used as a basis for other preemption related constructs. We illustrate this idea by presenting a generalized timeout and a simple UNIX-like system of concurrent preemptible threads.} } @INPROCEEDINGS{laleau01:_autom_gener_b_specif_well, AUTHOR = {R. Laleau and A. Mammar}, BOOKTITLE = {International Symposium on Programming Systems}, TITLE = {An Automatic Generation of B Specifications from Well-defined UML Notations for Database Applications}, YEAR = {2001}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://cedric.cnam.fr/PUBLIS/RC274.ps} } @INPROCEEDINGS{laleau01:_rigor_metam_uml_static_concep, AUTHOR = {R. Laleau and F. Polack}, BOOKTITLE = {CAISE'01}, TITLE = {A Rigorous Metamodel for UML Static Conceptual Modelling of Information Systems Specification}, YEAR = {2001}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {2068}, PS = {http://cedric.cnam.fr/PUBLIS/RC273.ps.gz} } @INPROCEEDINGS{MHL2001:SFP, AUTHOR = {A. Merlin and G. Hains and F. Loulergue}, BOOKTITLE = {Proceedings of the Third Scottish Functional Programming Workshop (SFP'2001)}, TITLE = {An SPMD Environment Machine for Functional BSP Programs}, YEAR = {2001}, ADDRESS = {Stirling}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {August}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/iscc/MokdadOG01, AUTHOR = {Lynda Mokdad and Jalel Ben-Othman and Abdelhak Gueroui}, BOOKTITLE = {Proceedings of the Sixth IEEE Symposium on Computers and Communications (ISCC 2001)}, TITLE = {Quality of Service of A Rerouting Algorithm Using Stochastic Automata Networks}, YEAR = {2001}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {338--343}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://csdl.computer.org/comp/proceedings/iscc/2001/1177/00/11770338abs.htm} } @INPROCEEDINGS{pelz01:_concur_seman_paral_progr_languag_static_excep, AUTHOR = {E. Pelz and H. Klaudel and F. Pommereau}, BOOKTITLE = {First FIDJI Workshop}, TITLE = {Concurrent Semantics of Parallel Programming Languages, including Static Exceptions}, YEAR = {2001}, ADDRESS = {Luxembourg}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/time/WijsenB01, AUTHOR = {Jef Wijsen and Alexis Bès}, BOOKTITLE = {TIME}, TITLE = {Temporal Tableau Queries}, YEAR = {2001}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {136-143}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://www.computer.org/proceedings/time/1107/11070136abs.htm} } @TECHREPORT{TR-LACL-2001-03, AUTHOR = {D. Beauquier and J.C. Fournier}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Groups and tilings}, YEAR = {2001}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2001-03}, OPTTYPE = {}, PS = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2001-03.ps.gz} } @TECHREPORT{TR-LACL-2001-05, AUTHOR = {D. Beauquier and A. Rabinovich and A. Slissenko}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A logic of probability with decidable model-checking}, YEAR = {2001}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2001-05}, OPTTYPE = {}, PS = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2001-05.ps.gz} } @TECHREPORT{TR-LACL-2001-01, AUTHOR = {P. Cegielski and F Heroult and D. Richard}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {On the amplitude of intervals of natural numbers whose every element is coprime with no extremity}, YEAR = {2001}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2001-01}, OPTTYPE = {}, PS = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2001-01.ps.gz} } @TECHREPORT{TR-LACL-2001-06, AUTHOR = {H. Fleischhack and E. Pelz}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Causal boxes and hierarchical timed boxes}, YEAR = {2001}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2001-06}, OPTTYPE = {}, PS = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2001-06.ps.gz} } @TECHREPORT{frappier01:_provin_refin_scenar_objec_orien_model, AUTHOR = {M. Frappier and R. Laleau}, INSTITUTION = {CEDRIC (CNAM)}, TITLE = {Proving the Refinement of Scenarios into Object-Oriented Models}, YEAR = {2001}, OPTADDRESS = {}, OPTMONTH = {}, NOTE = {TR-272 Université de Sherbrooke}, NUMBER = {277}, OPTTYPE = {}, PS = {http://cedric.cnam.fr/PUBLIS/RC277.ps.gz} } @TECHREPORT{giavitto01R, AUTHOR = {Jean-Louis Giavitto and Olivier Michel}, INSTITUTION = {LaMI -- Université d'Évry Val d'Essonne}, TITLE = {MGS: a Programming Language for the Transformations of Topological Collections}, YEAR = {2001}, OPTADDRESS = {}, MONTH = {May}, OPTNOTE = {}, NUMBER = {61-2001}, OPTTYPE = {}, URL = {http://www.ibisc.fr/~michel/PUBLIS/2001/lami-RR61--mgs.pdf} } @TECHREPORT{a.01:_b, AUTHOR = {R. Laleau and A. Mammar}, INSTITUTION = {CEDRIC (CNAM)}, TITLE = {Réutilisation des preuves dans le processus de raffinement B}, YEAR = {2001}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {377}, OPTTYPE = {} } @TECHREPORT{laleau01:_un_b, AUTHOR = {R. Laleau and A. Mammar}, INSTITUTION = {CEDRIC (CNAM)}, TITLE = {Un exemple de génération d'une implémentation relationnelle à partir d'une spécification B}, YEAR = {2001}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {368}, OPTTYPE = {} } @TECHREPORT{lammari01:_compl_mechan_based_applic_const, AUTHOR = {N. Lammari and R. Laleau}, INSTITUTION = {CEDRIC (CNAM)}, TITLE = {Complementary Mechanisms Based on Applicability Constraints for Supporting IS-A Inheritance Hierarchies Design}, YEAR = {2001}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {276}, OPTTYPE = {} } @TECHREPORT{TR-LACL-2001-04, AUTHOR = {Franck Pommereau and Christian Stehno}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {FIFO buffers in hot tie sauce}, YEAR = {2001}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2001-04}, OPTTYPE = {}, KEYWORDS = {Parallel programming, Petri nets, process algebras, FIFO buffers, semantics}, PS = {http://lacl.univ-paris12.fr/Rapports/TR/TR-2001-04.ps.gz}, ABSTRACT = {This paper introduces a new semantics for FIFO buffers (usually called channels) in a parallel programming language, B(PN)². This semantics is given in terms of M-nets, which form an algebra of labelled high-level Petri nets. The proposed approach uses the asynchronous link operator, newly introduced in the algebra of M-nets, and repairs some drawbacks of the original M-net semantics. Channels are now fully expressible within the algebra (it was not the case), they are significantly smaller (in number of places), and they offer several other advantages. } } @INBOOK{facon00:_softw_specif_method, PUBLISHER = {Springer}, TITLE = {Software Specification Methods : an Overview Using a Case Study}, YEAR = {2000}, AUTHOR = {P. Facon and R. Laleau and H. Phuong Nguyen}, CHAPTER = {From OMT Diagrams to B Specifications}, EDITOR = {Marc Frappier and Henri Habrias}, ALTPAGES = {}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, SERIES = {FACIT}, OPTTYPE = {}, OPTVOLUME = {} } @INCOLLECTION{BLH2000:SFP, AUTHOR = {O. Ballereau and F. Loulergue and G. Hains}, BOOKTITLE = {Trends in Functional Programming}, PUBLISHER = {Intellect Books}, TITLE = {High level BSP programming: BSML and BS$\lambda$}, YEAR = {2000}, ADDRESS = {Bristol UK, Portland, OR, USA}, CHAPTER = {4}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {G. Michaelson and P. Trinder and H.-W. Loidl}, MONTH = {August}, NOTE = {Preliminary version appeared in proceedings of SFP'99: First Scottish Functional Programming Workshop, TR RM/99/9, pp.43--52, Heriot-Watt University, September 1999.}, OPTNUMBER = {}, PAGES = {29--38}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @ARTICLE{DBLP:journals/jsyml/Bes00, AUTHOR = {Alexis Bès}, JOURNAL = {J. Symb. Log.}, TITLE = {An Extension of The Cobham-Semënov Theorem}, YEAR = {2000}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {201-211}, VOLUME = {65} } @ARTICLE{DBLP:journals/sLogica/Carbone00, AUTHOR = {Alessandra Carbone}, JOURNAL = {Studia Logica}, TITLE = {Quantified Propositional Logic and the Number of Lines of Tree-Like Proofs}, YEAR = {2000}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {315-321}, VOLUME = {64} } @ARTICLE{DBLP:journals/ijac/Caspard00, AUTHOR = {Nathalie Caspard}, JOURNAL = {IJAC}, TITLE = {The Lattice of Permutations is Bounded}, YEAR = {2000}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {481-490}, VOLUME = {10}, DOI = {10.1142/S0218196700000182} } @ARTICLE{DBLP:journals/endm/CaspardPMM00, AUTHOR = {Nathalie Caspard and de Poly-Barbut, Claude Le Conte and and Michel Morvan}, JOURNAL = {Electronic Notes in Discrete Mathematics}, TITLE = {Cayley lattices of finite Coxeter groups are bounded}, YEAR = {2000}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {56-59}, VOLUME = {5}, DOI = {10.1016/S1571-0653(05)80124-6} } @ARTICLE{hk-jalc, AUTHOR = {R. Devillers and H. Klaudel and E. Pelz}, JOURNAL = {Journal of Automata, Languages and Combinatorics}, TITLE = {An Algebraic Box Calculus}, YEAR = {2000}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, OPTPAGES = {}, VOLUME = {5} } @ARTICLE{ipl2000, AUTHOR = {L. Granvilliers and G. Hains}, JOURNAL = {Information Processing Letters}, TITLE = {A Conservative Scheme for Parallel Interval Narrowing}, YEAR = {2000}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3--4}, PAGES = {141--146}, VOLUME = {74} } @ARTICLE{LHF2000:SCP, AUTHOR = {F. Loulergue and G. Hains and C. Foisy}, JOURNAL = {Science of Computer Programming}, TITLE = {A Calculus of Functional BSP Programs}, YEAR = {2000}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1--3}, PAGES = {253--277}, VOLUME = {37} } @ARTICLE{Sliss:2000:ASMIW, AUTHOR = {Anatol Slissenko}, JOURNAL = {Bulletin of EATCS}, TITLE = {ASM2000: Abstract State Machine International Workshop}, YEAR = {2000}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {71}, PAGES = {219-220}, OPTVOLUME = {} } @ARTICLE{Sliss:2000:FSPD, AUTHOR = {Anatol Slissenko}, JOURNAL = {Bulletin of EATCS}, TITLE = {First St Petersburg Days of Logic and Computability}, YEAR = {2000}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {72}, PAGES = {197--199}, OPTVOLUME = {} } @INPROCEEDINGS{dexa2000, AUTHOR = {M. Bamha and G. Hains}, BOOKTITLE = {11th International Conference on Database and Expert Systems Applications, DEXA 2000}, TITLE = {A skew-insensitive algorithm for join and multi-join operations on Shared Nothing machines}, YEAR = {2000}, ADDRESS = {Greenwich, U.K.}, OPTCROSSREF = {}, EDITOR = {M. Ibrahim and J. Küng and N. Revell}, MONTH = {September}, OPTNOTE = {}, NUMBER = {1873}, OPTORGANIZATION = {}, PAGES = {644-653}, PUBLISHER = {Springer-Verlag}, SERIES = {Lecture Notes in Computer Science}, OPTVOLUME = {} } @INPROCEEDINGS{Beau00c, AUTHOR = {D. Beauquier and N. Kossovski and , Smirnova, E.}, BOOKTITLE = {Proceedings of International Conference On Applications Of Computer Algebra. IMACS ACA 2000}, TITLE = {An Algorithm For Solvability Testing Of Elementary Linear Inequalities Systems.}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {59-61}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{BeauSliss:2000:VTAG, AUTHOR = {Danièle Beauquier and Anatol Slissenko}, BOOKTITLE = {Proc. of the Intern. Workshop on Abstract State Machines (ASM'2000), March 20--24, 2000, Switzerland, Monte Verita, Ticino}, TITLE = {Verification of Timed Algorithms: Gurevich Abstract State Machines versus First Order Timed Logic}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Y. Gurevich and P. Kutter and M. Odersky and L. Thiele}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {22--39}, PUBLISHER = {ETH, Zürich}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/irma/BrashPGS00, AUTHOR = {Danny Brash and Nikos Prekas and Georges Grosz and Farida Semmak}, BOOKTITLE = {Challenges of Information Technology Management in the 21st Century, 2000 Information Resources Management Association International Conference, Anchorage, Alaska, USA, May 21-24, 2000}, TITLE = {Evaluating organizational patterns for supporting business knowledge management}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Mehdi Khosrowpour}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {775-777}, PUBLISHER = {IDEA Group Publishing}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{IGMA_CerDur00, AUTHOR = {Julien Cervelle and Bruno Durand}, BOOKTITLE = {17th International Symposium on Theoretical Aspects of Computer Science (STACS'00)}, TITLE = {Tilings : recursivity and regularity}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Horst Reichel and Sophie Tison}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {491--502}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {1770}, PDF = {http://igm.univ-mlv.fr/~jcervell/publi/tilings%20recursivity%20and%20regularity/tilings%20recursivity%20and%20regularity.pdf} } @INPROCEEDINGS{CohenSliss:2000:VRTD, AUTHOR = {Joëlle Cohen and Anatol Slissenko}, BOOKTITLE = {Proc. of the Intern. Workshop on Abstract State Machines (ASM'2000), March 20--24, 2000, Switzerland, Monte Verita, Ticino. Lect. Notes in Comput. Sci., vol. 1912}, TITLE = {On Verification of Refinements of Timed Distributed Algorithms}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Y. Gurevich and P. Kutter and M. Odersky and L. Thiele}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {34-49}, PUBLISHER = {Springer-Verlag}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{hk-icci, AUTHOR = {Raymond Devillers and Hanna Klaudel}, BOOKTITLE = {International Conference on Computing and Information'2000}, TITLE = {Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer-Verlag}, SERIES = {Lecture Notes in Computer Science}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/mfcs/DurandHK00, AUTHOR = {Arnaud Durand and Miki Hermann and Phokion G. Kolaitis}, BOOKTITLE = {Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings}, TITLE = {Subtractive Reductions and Complete Problems for Counting Complexity Classes}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Mogens Nielsen and Branislav Rovan}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {323-332}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {1893}, URL = {http://link.springer.de/link/service/series/0558/bibs/1893/18930323.htm} } @INPROCEEDINGS{fleischhack00:_partial_order_model_check_types, AUTHOR = {H. Fleischhack and E. Pelz}, BOOKTITLE = {Logic Colloquium}, TITLE = {Partial Order based Model Checking with data Types}, YEAR = {2000}, ADDRESS = {Paris}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{giavitto00a, AUTHOR = {Jean-Louis Giavitto and Olivier Michel}, BOOKTITLE = {Journées Francophones des Langages Applicatifs (JFLA00)}, TITLE = {Un cadre pour la définition récursive de données}, YEAR = {2000}, ADDRESS = {Mont Saint-Michel}, OPTCROSSREF = {}, EDITOR = {C. Dubois}, MONTH = {February}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {INRIA}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/1996/JFLA00.ps.gz} } @INPROCEEDINGS{DBLP:conf/inforsid/GroszS00, AUTHOR = {Georges Grosz and Farida Semmak}, BOOKTITLE = {Actes du XVIIIème Congrès INFORSID, Lyon, France, 16-19 mai, 2000}, TITLE = {Utilisation de patrons pour aider à la gestion du changement dans les entreprises}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {416-430}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/pdpta/Hait00, AUTHOR = {Férial Benachour Hait}, BOOKTITLE = {Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2000, June 24-29, 2000, Las Vegas, Nevada, USA}, TITLE = {Implementing a multi-agent system with Ada'95: A case study of a stock market}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Hamid R. Arabnia}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {CSREA Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{hk-dapsys00, AUTHOR = {Hanna Klaudel}, BOOKTITLE = {DAPSYS'00: Austrian-Hungarian Workshop on Distributed and Parallel Systems'00}, TITLE = {Parameterized M-expression Semantics of Parallel Procedures}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Kluwer Academic Publishers}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{IFM00, AUTHOR = {Hanna Klaudel and Franck Pommereau}, BOOKTITLE = {Integrated Formal Methods}, TITLE = {A concurrent and compositional Petri net semantics of preemption}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {W. Grieskamp, T. Santen and B. Stoddart}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {318-337}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {1945}, KEYWORDS = {Petri nets, Preemption, Concurrency, Compositionality}, URL = {http://hal.archives-ouvertes.fr/hal-00114693/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/11/46/93/PDF/2000-ifm.pdf }, ABSTRACT = {The aim of this paper is the introduction of preemption in a compositional model, called M-nets, which is based on Petri nets and hence provided with a concurrent semantics. We propose a way to model preemptible systems by extending the M-net model with priorities and the M-net algebra with a preemption operator. We show that these extensions can be seen as a high-level version of the well studied model of priority systems, and so, can be reduced to Petri nets (without priorities) which retain as much as possible of the original concurrency. As a consequence, Petri nets appear as a model powerful enough to deal with preemption in a compositional way and with a concurrent semantics.} } @INPROCEEDINGS{laleau00:_inter_combin_uml_b_formal, AUTHOR = {R. Laleau}, BOOKTITLE = {International Conference on Enterprise Information Systems (ICEIS 2000)}, TITLE = {On the Interest of Combining UML with the B Formal Method for the Specification of Database Applications}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{laleau00:_overv_method_tool_gener_b, AUTHOR = {R. Laleau and A. Mammar}, BOOKTITLE = {15th IEEE Int. Conf. on Automated Software Engineering (ASE2000)}, TITLE = {An Overview of a Method and its support Tool for Generating B Specifications from UML Notations}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{laleau00:_metam_static_concep_model_infor_system, AUTHOR = {R. Laleau and F. Polack}, BOOKTITLE = {Workshop on Defining Precise Semantics for UML, ECOOP'2000}, TITLE = {Metamodels for Static Conceptual Modelling of Information Systems}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{LOU2000:ISHPC, AUTHOR = {F. Loulergue}, BOOKTITLE = {International Symposium on High Performance Computing}, TITLE = {BS$\lambda_p$: Functional BSP Programs on Enumerated Vectors}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {J. Kazuki}, MONTH = {October}, OPTNOTE = {}, NUMBER = {1940}, OPTORGANIZATION = {}, PAGES = {355-363}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, OPTVOLUME = {} } @INPROCEEDINGS{BMP00, AUTHOR = {Mouad Ben Mamoun and Nihal Pekergin}, BOOKTITLE = {Mathematics and Computer Science}, TITLE = {Computing closed-form stochastic bounds on the stationary distribution of Markov chains}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {A. Mokkadem and D. Gardy}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Birkhauser}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{mourlin00:_progr_deploy_java_mobil_agent_pi_specif, AUTHOR = {F. Mourlin and O. Nguyen}, BOOKTITLE = {Wotug'23, 23rd World Occam Transputer User Group}, TITLE = {Programming and Deploying Java Mobile Agents from Pi-calculus Specification}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {April}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DAPSYS00, AUTHOR = {Franck Pommereau}, BOOKTITLE = {Distributed and parallel system, from instruction parallelism to cluster computing}, TITLE = {FIFO buffers in tie sauce}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {P. Kacsuk and G. Kotsis}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {95-104}, PUBLISHER = {Kluwer Academic Publishers}, OPTSERIES = {}, OPTVOLUME = {}, ABSTRACT = {This paper introduces a new semantics for FIFO buffers (more usually called channels) in a parallel programming language, B(PN)². This semantics is given in terms of M-nets, which form an algebra of labelled high-level Petri nets. The proposed approach makes usage of asynchronous link operator, newly introduced in the algebra of M-nets, and repairs some drawbacks of the previous M-net semantics. Channels are now fully expressible within the algebra (it was not the case), they are significantly smaller (in number of places), and they offer several other advantages.} } @INPROCEEDINGS{a.00:_gener_proces_refin_b_specif, AUTHOR = {et A. Mammar, R. Laleau}, BOOKTITLE = {First Int. Conf. of B and Z users (ZB2000)}, TITLE = {A Generic Process to Refine a B Specification into a Relational Database Implementation}, YEAR = {2000}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {1878}, PS = {http://cedric.cnam.fr/PUBLIS/RC104.ps.gz} } @TECHREPORT{lifo2000-03, AUTHOR = {M. Bamha and G. Hains}, INSTITUTION = {LIFO, Laboratoire d'Informatique Fondamentale d'Orléans}, TITLE = {A Symmetric Frequency-Adaptive Join Algorithm for Shared Nothing Machines}, YEAR = {2000}, ADDRESS = {Université d'Orléans}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {RR-LIFO-2000-03}, TYPE = {Research Report} } @TECHREPORT{TR-LACL-2000-25, AUTHOR = {D. Beauquier and T. Crolard and A. Slissenko}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A predicate logic framework for mechanical verification of real-time Gurevich Abstract State Machines: A case study with PVS}, YEAR = {2000}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2000-25}, OPTTYPE = {}, PDF = {http://lacl.univ-paris12.fr/Rapports/TR/TR-00-25.ps.gz} } @TECHREPORT{TR-LACL-2000-24, AUTHOR = {D. Beauquier and A. Rabinovich}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Monadic logic of order over naturals has no finite base}, YEAR = {2000}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2000-24}, OPTTYPE = {}, PS = {http://lacl.univ-paris12.fr/Rapports/TR/TR-00-24.ps.gz} } @TECHREPORT{TR-LACL-2000-23, AUTHOR = {D. Beauquier and A. Slissenko}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {A first order logic for specification of timed algorithms: Basic properties and a decidable class}, YEAR = {2000}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-2000-23}, OPTTYPE = {}, PS = {http://lacl.univ-paris12.fr/Rapports/TR/TR-00-23.ps.gz} } @TECHREPORT{lifo2000-15, AUTHOR = {S. Drouri and G. Hains}, INSTITUTION = {LIFO, Laboratoire d'Informatique Fondamentale d'Orléans}, TITLE = {Une version parallèle extensible de l'algorithme Particle Mesh Ewald}, YEAR = {2000}, ADDRESS = {Université d'Orléans}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {RR-LIFO-99-11}, TYPE = {Rapport de Recherche}, URL = {ftp://ftp-lifo.univ-orleans.fr/pub/RR/RR99/RR00-15.ps} } @TECHREPORT{laleau00:_using_formal_refin_deriv_relat, AUTHOR = {R. Laleau and A. Mammar}, INSTITUTION = {CEDRIC (CNAM)}, TITLE = {Using a Formal Refinement to Derive Relational Database Implementations from B Specifications}, YEAR = {2000}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {86}, OPTTYPE = {} } @ARTICLE{pdcp1999, AUTHOR = {M. Bamha and G. Hains}, JOURNAL = {Parallel and Distributed Computing Practices}, TITLE = {Frequency-adaptive join for Shared Nothing machines}, YEAR = {1999}, MONTH = {September}, NOTE = {Actually appeared in 2001. Also appears in F. Columbus ed. Progress in Computer Research Vol.II, Nova Press 2001.}, NUMBER = {3}, PAGES = {333-346}, VOLUME = {2} } @ARTICLE{Beau99c, AUTHOR = {D. Beauquier and D. E. Muller and P. E. Schupp}, JOURNAL = {Groups, Languages and Geometry}, TITLE = {The Bar Problem-A Simple Tiling Problem which is NP-complete on the Euclidean Tessellation by Squares but which is Polynomial Time on the Hyperbolic Tessellations by 4g-gons}, YEAR = {1999}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {29-36}, VOLUME = {250}, SERIES = {Comtemporary Mathematics} } @ARTICLE{DBLP:journals/apal/Carbone99, AUTHOR = {Alessandra Carbone}, JOURNAL = {Ann. Pure Appl. Logic}, TITLE = {Duplication of Directed Graphs and Exponential Blow Up of Proofs}, YEAR = {1999}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1-3}, PAGES = {1-67}, VOLUME = {100} } @ARTICLE{DBLP:journals/apal/Carbone99a, AUTHOR = {Alessandra Carbone}, JOURNAL = {Ann. Pure Appl. Logic}, TITLE = {Turning Cycles into Spirals}, YEAR = {1999}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1-3}, PAGES = {57-73}, VOLUME = {96} } @ARTICLE{DBLP:journals/dmtcs/Caspard99, AUTHOR = {Nathalie Caspard}, JOURNAL = {Discrete Mathematics & Theoretical Computer Science}, TITLE = {A characterization for all interval doubling schemes of the lattice of permutations}, YEAR = {1999}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {177-188}, VOLUME = {3}, URL = {http://dmtcs.loria.fr/volumes/abstracts/dm030405.abs.html} } @ARTICLE{DBLP:journals/endm/CaspardM99, AUTHOR = {Nathalie Caspard and Bernard Monjardet}, JOURNAL = {Electronic Notes in Discrete Mathematics}, TITLE = {The lattices of Moore families and closure operators on a finite set: A survey}, YEAR = {1999}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {25-50}, VOLUME = {2}, DOI = {10.1016/S1571-0653(04)00013-7} } @ARTICLE{Crolard99, AUTHOR = {T. Crolard}, JOURNAL = {Journal of Functional Programming}, TITLE = {A confluent lambda-calculus with a catch/throw mechanism}, YEAR = {1999}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {6}, PAGES = {625--647}, VOLUME = {9} } @ARTICLE{GrigSliss:1999:CMLP, AUTHOR = {D. Grigoriev and Anatol Slissenko}, JOURNAL = {St. Petersburg Math. J.}, TITLE = {Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane}, YEAR = {1999}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {315-332}, VOLUME = {10} } @ARTICLE{lammari99:_proces, AUTHOR = {N. Lammari and R. Laleau and M. Jouve}, JOURNAL = {Revue Objet}, TITLE = {Processus d'optimisation conceptuelle d'un schéma orienté objet}, YEAR = {1999}, OPTMONTH = {}, NOTE = {Hermés}, NUMBER = {1}, OPTPAGES = {}, VOLUME = {5} } @ARTICLE{DBLP:journals/pe/Pekergin99, AUTHOR = {Nihal Pekergin}, JOURNAL = {Performance Evaluation}, TITLE = {Stochastic Performance Bounds by State Space Reduction}, YEAR = {1999}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1-4}, PAGES = {1-17}, VOLUME = {36-37}, PUBLISHER = {Elsevier} } @INPROCEEDINGS{dexa99, AUTHOR = {M. Bamha and F. Bentayeb and G. Hains}, BOOKTITLE = {10th International Conference on Database and Expert Systems Applications, DEXA'99}, TITLE = {An efficient scalable parallel view maintenance algorithm for shared nothing multi-processor machines}, YEAR = {1999}, ADDRESS = {Florence, Italy}, OPTCROSSREF = {}, EDITOR = {Trevor Bench-Capon and Giovanni Soda and A Min Tjoa}, MONTH = {August 30 -- September 3}, OPTNOTE = {}, NUMBER = {1677}, OPTORGANIZATION = {}, PAGES = {616--625}, PUBLISHER = {Springer-Verlag}, SERIES = {Lecture Notes in Computer Science}, OPTVOLUME = {} } @INPROCEEDINGS{Beau99a, AUTHOR = {D. Beauquier and J. Cohen}, BOOKTITLE = {Proc. of the 2nd International Conf. on Computer Science and Information Technologies (CSIT'99)}, TITLE = {From Timed Automata to Timed Abstract State Machines}, YEAR = {1999}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {18-23}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{BeauSliss:1999:DCVP, AUTHOR = {Danièle Beauquier and Anatol Slissenko}, BOOKTITLE = {Proc. of the 12th Intern. Symp. on Fundamentals of Computation Theory (FCT'99), Iasi, Rumania, August 30 --September 3, 1999, Lect. Notes in Comput. Sci, vol. 1684}, TITLE = {Decidable Classes of the Verification Problem in a Timed Predicate Logic}, YEAR = {1999}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {G. Ciobanu and Gh. Paun}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {100--111}, PUBLISHER = {Springer-Verlag}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Crolard98c, AUTHOR = {T. Crolard}, BOOKTITLE = {Tutorial Workshop on Realizability Semantics and Applications'99}, TITLE = {A Type Theory which is complete for Kreisel's Modified Realizability}, YEAR = {1999}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, SERIES = {ENTCS}, VOLUME = {23} } @INPROCEEDINGS{Crolard98d, AUTHOR = {T. Crolard}, BOOKTITLE = {Journées Francophones des Langages Applicatifs}, TITLE = {Typage des coroutines en logique soustractive}, YEAR = {1999}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {Février}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, SERIES = {Collection Didactique de l'INRIA}, OPTVOLUME = {} } @INPROCEEDINGS{NSMC, AUTHOR = {Tugrul Dayar and Nihal Pekergin}, BOOKTITLE = {Numerical Solution of Markov Chains (NSMC'99)}, TITLE = {Stochastic comparaison, reorderings and nearly completely decomposable Markov chains}, YEAR = {1999}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {228-246}, PUBLISHER = {Prensas Universitarias de Zaragoza}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{isei99, AUTHOR = {I. Debourges and G. Hains and S. Guilloré and de la Clergerie, E.}, BOOKTITLE = {Information Technology, Proceedings of the fourth international symposium on Economic Informatics - May 99}, TITLE = {Vers un analyseur syntaxique parallèle}, YEAR = {1999}, ADDRESS = {Bucharest, Romania}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {May}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/mfcs/DurandHJ99, AUTHOR = {Arnaud Durand and Miki Hermann and Laurent Juban}, BOOKTITLE = {Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS'99, Szklarska Poreba, Poland, September 6-10, 1999, Proceedings}, TITLE = {On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System}, YEAR = {1999}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Miroslaw Kutylowski and Leszek Pacholski and Tomasz Wierzbicki}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {92-102}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {1672} } @INPROCEEDINGS{giavitto99a, AUTHOR = {Jean-Louis Giavitto and Olivier Michel}, BOOKTITLE = {Journées Francophones des Langages Applicatifs (JFLA99)}, TITLE = {Calcul distribué de champs de données}, YEAR = {1999}, ADDRESS = {Avoriaz}, OPTCROSSREF = {}, EDITOR = {P. Weis}, MONTH = {February}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {INRIA}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/1999/JFLA99.ps.gz } } @INPROCEEDINGS{DBLP:conf/dexaw/GnahoL99, AUTHOR = {Christophe Gnaho and François Larcher}, BOOKTITLE = {DEXA Workshop}, TITLE = {A Goal-Driven Approach to Web Navigation Modeling}, YEAR = {1999}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {739-743}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://computer.org/conferen/proceed/dexa/0281/02810739abs.htm} } @INPROCEEDINGS{ASIAN99, AUTHOR = {Hanna Klaudel and Franck Pommereau}, BOOKTITLE = {Advances in Computing Science - ASIAN'99}, TITLE = {Asynchronous links in the PBC and M-nets}, YEAR = {1999}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {P. S. Thiagarajan and R. Yap}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {190-200}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {1742}, KEYWORDS = {Petri Net, Petri Box Calculus, M-Net, Semantics, Timed Specification}, URL = {http://hal.archives-ouvertes.fr/hal-00114697/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/11/46/97/PDF/1999-asian.pdf }, ABSTRACT = {This paper aims at introducing an extension of M-nets, a fully compositional class of high-level Petri nets, and of its low-level counter part, Petri Boxes Calculus (PBC). We introduce a new operator with nice algebraic properties which allows to express asynchronous communications in a simple and flexible way. With this extension, asynchronous communications become at least as simple to express as (existing) synchronous ones. Finally, we show how this extension can be used in order to specify systems with timing constraints.} } @INPROCEEDINGS{hk-pdpta, AUTHOR = {Hanna Klaudel and R.-C. Riemann}, BOOKTITLE = {Parallel and Distributed Processing Techniques and Applications'99}, TITLE = {Refinement-based Semantics of Parallel Procedures}, YEAR = {1999}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {CSREA Press}, OPTSERIES = {}, VOLUME = {4} } @INPROCEEDINGS{jfplc99, AUTHOR = {A. Lallouet and G. Hains}, BOOKTITLE = {Journées Francophones de Programmation Logique et par Contraintes}, TITLE = {Programmation par Contraintes Parallèle: l'Approche CLP(${X}^{[\,]}$)}, YEAR = {1999}, ADDRESS = {Lyon}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {Juin}, OPTNOTE = {}, OPTNUMBER = {}, ORGANIZATION = {AFPLC}, OPTPAGES = {}, PUBLISHER = {Hermès}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/infocom/Pekergin99, AUTHOR = {Nihal Pekergin}, BOOKTITLE = {INFOCOM}, TITLE = {Stochastic Bounds on Delays of Fair Queueing Algorithms}, YEAR = {1999}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {1212-1219}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/dexa/PrekasLRGSB99, AUTHOR = {Nikos Prekas and Pericles Loucopoulos and Colette Rolland and Georges Grosz and Farida Semmak and Danny Brash}, BOOKTITLE = {Database and Expert Systems Applications, 10th International Conference, DEXA '99, Florence, Italy, August 30 - September 3, 1999, Proceedings}, TITLE = {Developing Patterns as a Mechanism for Assisting the Management of Knowledge in the Context of Conducting Organisational Change}, YEAR = {1999}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Trevor J. M. Bench-Capon and Giovanni Soda and A. Min Tjoa}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {110-122}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {1677}, URL = {http://link.springer.de/link/service/series/0558/bibs/1677/16770110.htm} } @INPROCEEDINGS{Sliss:1999:MEKR, AUTHOR = {Anatol Slissenko}, BOOKTITLE = {Proc. of the 2nd International Conf. on Computer Science and Information Technologies, August 17--22, 1999, Yerevan, Armenia}, TITLE = {Minimizing Entropy of Knowledge Representaion}, YEAR = {1999}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {2--6}, PUBLISHER = {National Academy of Sciences of Armenia}, OPTSERIES = {}, OPTVOLUME = {} } @TECHREPORT{lifo99-3, AUTHOR = {M. Bamha and F. Bentayeb and G. Hains}, INSTITUTION = {Université d'Orléans, LIFO}, TITLE = {Un algorithme incrémental pour la maintenance des vues matérialisées}, YEAR = {1999}, ADDRESS = {Orléans, France}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {99-3}, TYPE = {Rapport de Recherche} } @TECHREPORT{TR-LACL-1999-17, AUTHOR = {D. Beauquier and JoÃlle Cohen}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {From timed automata to timed abstract state machine}, YEAR = {1999}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-1999-17}, OPTTYPE = {}, PS = {http://lacl.univ-paris12.fr/Rapports/TR/TR-99-17.ps.gz} } @TECHREPORT{facon99:_combin_uml_b_formal_method, AUTHOR = {P. Facon and R. Laleau and A. Mammar}, INSTITUTION = {CEDRIC (CNAM)}, TITLE = {Combining UML with the B Formal Method for the Specification of Database Applications}, YEAR = {1999}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {87}, OPTTYPE = {} } @TECHREPORT{facon99:_formal_specif_uml_metam_build, AUTHOR = {P. Facon and R. Laleau and A. Mammar and F. Polack}, INSTITUTION = {CEDRIC (CNAM)}, TITLE = {Formal Specification of the UML Metamodel for Building Rigorous Caise Tools}, YEAR = {1999}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {91}, OPTTYPE = {} } @TECHREPORT{lifo99-11, AUTHOR = {A. Lallouet and G. Hains}, INSTITUTION = {LIFO, Laboratoire d'Informatique Fondamentale d'Orléans}, TITLE = {Parallel Constraint Programming over BSP Vectors}, YEAR = {1999}, ADDRESS = {Université d'Orléans}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {RR-LIFO-99-11}, TYPE = {Research Report}, PS = {ftp://ftp-lifo.univ-orleans.fr/pub/RR/RR99/RR99-11.ps} } @TECHREPORT{lodec-dec98, AUTHOR = {du GDR.-ALP Éd. S. Anantharaman et G. Hains, Groupe LODEC}, INSTITUTION = {LIFO, Laboratoire d'Informatique Fondamentale d'Orléans}, TITLE = {Actes des journées LODEC}, YEAR = {1999}, ADDRESS = {Université d'Orléans, France}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {RR-LIFO-99-02}, TYPE = {Rapport de Recherche}, PS = {ftp://ftp-lifo.univ-orleans.fr/pub/RR/RR99/RR99-02.ps} } @PHDTHESIS{caspard98, AUTHOR = {Nathalie caspard}, SCHOOL = {Université Paris 1}, TITLE = {Etude structurelle et algorithmique de classes de treillis obtenus par duplications}, YEAR = {1998}, OPTADDRESS = {}, MONTH = {décembre}, OPTNOTE = {}, OPTTYPE = {} } @INCOLLECTION{Slissenko:1998:SPLL, AUTHOR = {Anatol Slissenko}, BOOKTITLE = {People and Ideas In Theoretical Computer Science}, PUBLISHER = {Springer-Verlag}, TITLE = {St.Petersburg/Leningrad (1961-1998): From Logic to Complexity and Further}, YEAR = {1998}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {C. Calude}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {274--313}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @ARTICLE{BeauSliss:1998:PMCT, AUTHOR = {Danièle Beauquier and Anatol Slissenko}, JOURNAL = {Acta Informatica}, TITLE = {Polytime Model Checking for Timed Probabilistic Computation Tree Logic}, YEAR = {1998}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {645--664}, VOLUME = {35} } @ARTICLE{best98:_m, AUTHOR = {E. Best and W. Fraczak and R.P. Hopkins and H. Klaudel and E. Pelz.}, JOURNAL = {Acta Informatica}, TITLE = {M-nets: an Algebra of High-level Petri Nets with an Application to the Semantics of Concurrent Programming Languages}, YEAR = {1998}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {35}, PAGES = {813--857}, OPTVOLUME = {} } @ARTICLE{DBLP:journals/jsyml/BesR98, AUTHOR = {Alexis Bès and Denis Richard}, JOURNAL = {J. Symb. Log.}, TITLE = {Undecidable Extensions of Skolem Arithmetic}, YEAR = {1998}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {379-401}, VOLUME = {63} } @ARTICLE{DBLP:journals/logcom/DurandLS98, AUTHOR = {Arnaud Durand and Clemens Lautemann and Thomas Schwentick}, JOURNAL = {J. Log. Comput.}, TITLE = {Subclasses of Binary NP}, YEAR = {1998}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {189-207}, VOLUME = {8} } @ARTICLE{FPV98, AUTHOR = {Jean-Michel Fourneau and Nihal Pekergin and Dominique VerchÂre}, JOURNAL = {RAIRO Recherche Opérationnelle}, TITLE = {Réseaux généralisés multiclasses avec sychronisations cycliques}, YEAR = {1998}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {353-372}, VOLUME = {32}, PUBLISHER = {EDP Sciences} } @ARTICLE{DBLP:journals/cc/SanthaT98, AUTHOR = {Miklos Santha and Sovanna Tan}, JOURNAL = {Computational Complexity}, TITLE = {Verifying the Determinant in Parallel}, YEAR = {1998}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {128-151}, VOLUME = {7} } @INPROCEEDINGS{DBLP:conf/mascots/AbuamshaP98, AUTHOR = {O. Abuamsha and Nihal Pekergin}, BOOKTITLE = {Proceedings of the Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)}, TITLE = {Comparison of Fair Queuing Algorithms with a Stochastic Approach}, YEAR = {1998}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {139}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {}, PDF = {http://dlib.computer.org/conferen/mascots/8566/pdf/85660139.pdf} } @INPROCEEDINGS{pdcs98-pdbms, AUTHOR = {M. Bamha and G. Hains}, BOOKTITLE = {Proceedings of International Conference on Parallel and Distributed Computing and Systems (PDCS)}, TITLE = {A Self-Balancing Join Algorithm for SN Machines}, YEAR = {1998}, ADDRESS = {Las Vegas, USA}, OPTCROSSREF = {}, EDITOR = {Y. Pan and S. G. Akl and K. Li}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {285--290}, PUBLISHER = {IASTED/ACTA Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Beau98a, AUTHOR = {D. Beauquier}, BOOKTITLE = {Proceedings of FoSSaCS'98}, TITLE = {Pumping Lemmas for timed automata}, YEAR = {1998}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1378}, OPTORGANIZATION = {}, PAGES = {81-94}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, OPTVOLUME = {} } @INPROCEEDINGS{hk-inpn98, AUTHOR = {V. Benzaken and N. Hugon and H. Klaudel and E. Pelz and R.-C. Riemann}, BOOKTITLE = {Application and Theory of Petri Nets 1998}, TITLE = {M-net based Semantics for Triggers}, YEAR = {1998}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {J. Desel and M. Silva}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer-Verlag}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {1420} } @INPROCEEDINGS{DBLP:conf/asm/Durand98, AUTHOR = {Arnaud Durand}, BOOKTITLE = {Workshop on Abstract State Machines}, TITLE = {Modeling Cache Coherence Protocol - A Case Study with FLASH}, YEAR = {1998}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {111-126}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/cpe/FourneauM98, AUTHOR = {Jean-Michel Fourneau and Lynda Mokdad}, BOOKTITLE = {Computer Performance Evaluation: Modelling Techniques and Tools, 10th International Conference (Tools'98)}, TITLE = {A Perturbation and Reduction Based Algorithm}, YEAR = {1998}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Ramón Puigjaner and Nunzio N. Savino and Bartomeu Serra}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {142--153}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {1469}, URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=1469&spage=0142} } @INPROCEEDINGS{pdcs98-bssolve, AUTHOR = {L. Granvilliers and G. Hains and Q. Miller and N. Romero}, BOOKTITLE = {Proceedings of International Conference on Parallel and Distributed Computing and Systems (PDCS)}, TITLE = {A system for the high-level parallelization and cooperation of constraint solvers}, YEAR = {1998}, ADDRESS = {Las Vegas, USA}, OPTCROSSREF = {}, EDITOR = {Y. Pan and S. G. Akl and K. Li}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {596--601}, PUBLISHER = {IASTED/ACTA Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{GrigSliss:1998:PASP, AUTHOR = {D. Grigoriev and Anatol Slissenko}, BOOKTITLE = {Proc. of the 1998 Int. ACM Symp. on Symbolic and Algebraic Computations (ISSAC'98)}, TITLE = {Polytime Algorithm for the Shortest Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane}, YEAR = {1998}, ADDRESS = {Dresden, Germany}, OPTCROSSREF = {}, EDITOR = {O. Gloor}, MONTH = {August 13--15}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {17--24}, PUBLISHER = {ACM Press}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{pdpta98, AUTHOR = {G. Hains}, BOOKTITLE = {PDPTA'98 International Conference on Parallel and Distributed Processing Techniques and Applications}, TITLE = {Subset Synchronization in BSP Computing}, YEAR = {1998}, ADDRESS = {Las Vegas}, OPTCROSSREF = {}, EDITOR = {H. R. Arabnia}, MONTH = {July}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {242--246}, PUBLISHER = {CSREA Press}, OPTSERIES = {}, VOLUME = {I} } @INPROCEEDINGS{hk-dapsys98, AUTHOR = {H. Klaudel and E. Pelz and R.-C. Riemann}, BOOKTITLE = {DAPSYS'98: Austrian-Hungarian Workshop on Distributed and Parallel Systems'98}, TITLE = {Relating M-expressions and M-nets}, YEAR = {1998}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-120}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Institut für Informatik, Univerity of Vienna}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{lammari98:_normal_denor, AUTHOR = {N. Lammari and R. Laleau and M. Jouve}, BOOKTITLE = {International Conference on Object-Oriented Information Systems (OOIS'98)}, TITLE = {Normalization and Denormalization : Two Mechanisms for Reorganizing IS_A Inheritance Hierarchies}, YEAR = {1998}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {38--53}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, OPTVOLUME = {} } @INPROCEEDINGS{mourlin98:_limit_java_featur_mobil_applic, AUTHOR = {F. Mourlin and M. Sakovis}, BOOKTITLE = {HPCN Workshop on Distributed Computing}, TITLE = {Limits of Java Features for Mobiles Applications}, YEAR = {1998}, ADDRESS = {RAI Conference Center Amsterdam}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {April}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/ifip8-1/RollandGNYG98, AUTHOR = {Colette Rolland and Georges Grosz and Selmin Nurcan and W. Yue and Christophe Gnaho}, BOOKTITLE = {Information Systems in the WWW Environment, IFIP TC8/WG8.1 Working Conference on Information Systems in the WWW Environment, 15-17 July 1998, Beijing, China}, TITLE = {An electronic handbook for accessing domain specific generic patterns}, YEAR = {1998}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Colette Rolland and Yu Chen and Meiqi Fang}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {89-111}, PUBLISHER = {Chapman & Hall}, SERIES = {IFIP Conference Proceedings}, VOLUME = {115} } @INPROCEEDINGS{DBLP:conf/ifip8-1/YueG98, AUTHOR = {W. Yue and Christophe Gnaho}, BOOKTITLE = {Information Systems in the WWW Environment, IFIP TC8/WG8.1 Working Conference on Information Systems in the WWW Environment, 15-17 July 1998, Beijing, China}, TITLE = {Diagram drawer & browser for visual information processing on the WWW}, YEAR = {1998}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Colette Rolland and Yu Chen and Meiqi Fang}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {361-372}, PUBLISHER = {Chapman & Hall}, SERIES = {IFIP Conference Proceedings}, VOLUME = {115} } @TECHREPORT{TR-LACL-1998-16, AUTHOR = {D. Beauquier and A. Slissenko}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Decidable verification for reducible timed automata specified in a first order logic with time}, YEAR = {1998}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-1998-16}, OPTTYPE = {}, PS = {http://lacl.univ-paris12.fr/Rapports/TR/TR-98-16.ps.gz} } @TECHREPORT{lifo98-09, AUTHOR = {F. Loulergue and G. Hains}, INSTITUTION = {Université d'Orléans, LIFO}, TITLE = {An Introduction to BS$\lambda$}, YEAR = {1998}, ADDRESS = {Orléans, France}, MONTH = {september}, OPTNOTE = {}, NUMBER = {98-09}, TYPE = {Rapport de Recherche} } @TECHREPORT{michel98, AUTHOR = {Olivier Michel and Jean-Louis Giavitto}, INSTITUTION = {LaMI -- Université d'Évry Val d'Essonne}, TITLE = {Amalgams: Names and Name Capture in a Declarative Framework}, YEAR = {1998}, OPTADDRESS = {}, MONTH = {January}, NOTE = {also avalaible as LRI Research-Report RR-1159}, NUMBER = {32}, OPTTYPE = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/1996/rapport-amalgame.ps.gz} } @ARTICLE{DBLP:journals/apal/Bes97, AUTHOR = {Alexis Bès}, JOURNAL = {Ann. Pure Appl. Logic}, TITLE = {On Pascal Triangles Modulo a Prime Power}, YEAR = {1997}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {17-35}, VOLUME = {89} } @ARTICLE{DBLP:journals/jsyml/Bes97, AUTHOR = {Alexis Bès}, JOURNAL = {J. Symb. Log.}, TITLE = {Undecidable Extensions of Büchi Arithmetic and Cobham-Semënov Theorem}, YEAR = {1997}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {1280-1296}, VOLUME = {62} } @ARTICLE{DBLP:journals/apal/Carbone97, AUTHOR = {Alessandra Carbone}, JOURNAL = {Ann. Pure Appl. Logic}, TITLE = {Interpolants, Cut Elimination and Flow Graphs for the Propositional Calculus}, YEAR = {1997}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {249-299}, VOLUME = {83} } @ARTICLE{DBLP:journals/re/GroszRSSPSAG97, AUTHOR = {Georges Grosz and Colette Rolland and S. Schwer and Carine Souveyet and Véronique Plihon and Samira Si-Said and Camille Ben Achour and Christophe Gnaho}, JOURNAL = {Requir. Eng.}, TITLE = {Modelling and Engineering the Requirements Engineering Process: An Overview of the NATURE Approach}, YEAR = {1997}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {115-131}, VOLUME = {2} } @ARTICLE{DBLP:journals/tcs/Lacoste97, AUTHOR = {Thierry Lacoste}, JOURNAL = {Theor. Comput. Sci.}, TITLE = {0-1 Laws by Preservation}, YEAR = {1997}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1-2}, PAGES = {237-245}, VOLUME = {184}, DOI = {10.1016/S0304-3975(97)00086-8} } @ARTICLE{DBLP:journals/mlq/Lacoste97, AUTHOR = {Thierry Lacoste}, JOURNAL = {Math. Log. Q.}, TITLE = {A Simplified Proof of the 0-1 Law for Existential Second-Order Ackermann Sentences}, YEAR = {1997}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {413-418}, VOLUME = {43} } @ARTICLE{DBLP:journals/dm/MonjardetC97, AUTHOR = {Bernard Monjardet and Nathalie Caspard}, JOURNAL = {Discrete Mathematics}, TITLE = {On a dependence relation in finite lattices}, YEAR = {1997}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {497-505}, VOLUME = {165-166}, DOI = {10.1016/S0012-365X(96)00196-3} } @INPROCEEDINGS{CFIP, AUTHOR = {Oula Abuamsha and Jean-Michel Fourneau and Nihal Pekergin}, BOOKTITLE = {In CFIP 97}, TITLE = {Une discipline équitable, minimisant la dispersion et adaptée au bas de bits}, YEAR = {1997}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Hermes}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{BeauSliss:1997:RCPS, AUTHOR = {Danièle Beauquier and Anatol Slissenko}, BOOKTITLE = {Proceedings of the 7th Intern. Symp. on Theory and Practice of Software Development (TAPSOFT'97), Lect. Notes in Comput. Sci, vol. 1214}, TITLE = {The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and their Model-Checking in High-Level Languages}, YEAR = {1997}, ADDRESS = {Lille, France}, OPTCROSSREF = {}, EDITOR = {M. Bidoit and M. Dauchet}, MONTH = {April 14--18, 1997}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {201--212}, PUBLISHER = {Springer-Verlag}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{hk-pnse, AUTHOR = {Raymond Devillers and Hanna Klaudel and R.-C. Riemann}, BOOKTITLE = {Petri Nets in System Engeneering - Modelling, Verification and Validation'97}, TITLE = {General Parameterised Refinement for M-Nets}, YEAR = {1997}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {B. Farwer and D. Moldt and M.-O. Stehr}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Universität Hamburg}, OPTSERIES = {}, VOLUME = {FBI-HH-B-205/97} } @INPROCEEDINGS{hk-fst-tcs, AUTHOR = {Raymond Devillers and Hanna Klaudel and R.-C. Riemann}, BOOKTITLE = {Foundations of Software Technology and Theoretical Computer Science}, TITLE = {General Refinement for High Level Petri Nets}, YEAR = {1997}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {S. Ramesh and G. Sivakumar}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer-Verlag}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {1346} } @INPROCEEDINGS{DBLP:conf/csl/DurandFL97, AUTHOR = {Arnaud Durand and Ronald Fagin and Bernd Loescher}, BOOKTITLE = {Computer Science Logic, 11th International Workshop, CSL '97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers}, TITLE = {Spectra with Only Unary Function Symbols}, YEAR = {1997}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Mogens Nielsen and Wolfgang Thomas}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {189-202}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {1414} } @INPROCEEDINGS{DBLP:conf/cpe/FourneauMP97, AUTHOR = {Jean-Michel Fourneau and Lynda Mokdad and Nihal Pekergin}, BOOKTITLE = {9th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools}, TITLE = {Bounding the Loss Rates in a Multistage ATM Switch}, YEAR = {1997}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Raymond A. Marie and Brigitte Plateau and Maria Calzarossa and Gerardo Rubino}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {193-205}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {1245}, DOI = {10.1007/BFb0022207} } @INPROCEEDINGS{fraczak97:_pbc, AUTHOR = {W. Fraczak and E. Pelz}, BOOKTITLE = {ICON'97}, TITLE = {A new structural equivalence on labeled nets for PBC based on a reduction of silent transitions}, YEAR = {1997}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {M. Diaz and M. Balbi}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1248}, OPTORGANIZATION = {}, PAGES = {117--135}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, OPTVOLUME = {} } @INPROCEEDINGS{giavitto97a, AUTHOR = {Jean-Louis Giavitto and De Vito, D. and Olivier Michel}, BOOKTITLE = {Ninth International Symposium on Programming Languages, Implementations, Logics, and Programs (PLILP'97)}, TITLE = {Semantics and Compilation of Recursive Sequential Streams in 8riptsize 1/2}, YEAR = {1997}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {H. Glaser and H. Kuchen}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {207--223}, PUBLISHER = {Springer Verlag}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {1292}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/1997/plilp97.pdf} } @INPROCEEDINGS{GrigSliss:1997:MLPH, AUTHOR = {D. Grigoriev and Anatol Slissenko}, BOOKTITLE = {Proc. of the 12th Intern. Symp. on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC'12), Lect. Notes in Comput. Sci, vol. 1255}, TITLE = {Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane}, YEAR = {1997}, ADDRESS = {Toulouse, France}, OPTCROSSREF = {}, EDITOR = {T. Mora and H. Mattson}, MONTH = {June 23--27, 1997}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {114--129}, PUBLISHER = {Springer-Verlag}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{pacrim97, AUTHOR = {G. Hains and van Emden, M. H.}, BOOKTITLE = {PACRIM'97, Pacific Rim Conference on Communications, Computers and Signal Processing}, TITLE = {Towards High-Quality, High-Speed Numerical Computation}, YEAR = {1997}, ADDRESS = {University of Victoria, B.C., Canada}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {August}, OPTNOTE = {}, OPTNUMBER = {}, ORGANIZATION = {IEEE}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{europar97, AUTHOR = {F. Loulergue and G. Hains}, BOOKTITLE = {Euro-Par'97 Parallel Processing}, TITLE = {Parallel Functional Programming with Explicit Processes: Beyond SPMD}, YEAR = {1997}, ADDRESS = {Passau, Germany}, OPTCROSSREF = {}, EDITOR = {C. Lengauer, and M. Griebl, and S. Gorlatch, }, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1300}, OPTORGANIZATION = {}, PAGES = {530--537}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, OPTVOLUME = {} } @INPROCEEDINGS{jfla97, AUTHOR = {F. Loulergue and G. Hains}, BOOKTITLE = {Journées Francophones des Langages Applicatifs JFLA'97}, TITLE = {Programmation Fonctionnelle Parallèle en Processus Statiques: Une Approche Dénotationnelle}, YEAR = {1997}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {Janvier}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {INRIA}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{mourlin97:_limit_java_featur_mobil_applic, AUTHOR = {F. Mourlin and M. Sakovis}, BOOKTITLE = {First International Workshop on Mobile Agents (MA'97)}, TITLE = {Limits of Java Features for Mobile Applications}, YEAR = {1997}, ADDRESS = {Berlin, Germany}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {April}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @TECHREPORT{lifo97-12, AUTHOR = {M. Bamha and G. Hains}, INSTITUTION = {LIFO, Université d'Orléans}, TITLE = {Prévision des performances de la $\Theta$-jointure et de la multi-jointure pour des machines SN}, YEAR = {1997}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {97-12}, TYPE = {Rapport de Recherche} } @TECHREPORT{TR-LACL-1997-15, AUTHOR = {D. Beauquier and A. Slissenko}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {On semantics of algorithms with continuous time}, YEAR = {1997}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-1997-15}, OPTTYPE = {}, PS = {http://lacl.univ-paris12.fr/Rapports/TR/TR-97-15.ps.gz} } @TECHREPORT{TR-LACL-1997-11, AUTHOR = {N. K. Kossovski and A. V. Tishkov}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Logical Theory of Post Logics with Linear Order}, YEAR = {1997}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-1997-11}, OPTTYPE = {}, PS = {http://lacl.univ-paris12.fr/Rapports/TR/TR-97-11.ps.gz} } @TECHREPORT{TR-LACL-1997-12, AUTHOR = {G.A. Leonov and I.V. Ilyn and I.A. Komarchev}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Cycles of Two-Dimensional Quadratric Systems. Analytical Methods and Computer Experiments}, YEAR = {1997}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-1997-12}, OPTTYPE = {}, PS = {http://lacl.univ-paris12.fr/Rapports/TR/TR-97-12.ps.gz} } @TECHREPORT{lifo97-13, AUTHOR = {F. Loulergue and G. Hains}, INSTITUTION = {LIFO, Université d'Orléans}, TITLE = {Design of an Event-Oriented Functional Parallel Language: the Finite Case}, YEAR = {1997}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {97-13}, TYPE = {Rapport de Recherche} } @PHDTHESIS{michel96d, AUTHOR = {Olivier Michel}, SCHOOL = {Université de Paris-Sud, centre d'Orsay}, TITLE = {Représentations dynamiques de l'espace dans un langage déclaratif de simulation}, YEAR = {1996}, OPTADDRESS = {}, MONTH = {December}, NOTE = {N$^\circ 4596$, (in french)}, OPTTYPE = {}, URL = {http://tel.archives-ouvertes.fr/tel-00305748/en/}, PDF = {http://tel.archives-ouvertes.fr/docs/00/30/57/48/PDF/crv.pdf}, PS = {http://www.ibisc.fr/~michel/PUBLIS/1996/phd.ps.gz} } @ARTICLE{BurRougSliss:1996:CPOM, AUTHOR = {D. Burago and de Rougemont, A. and Anatol Slissenko}, JOURNAL = {Theoret. Comput. Sci.}, TITLE = {On the Complexity of Partially Observed Markov Decision Processes}, YEAR = {1996}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {161--183}, VOLUME = {157} } @ARTICLE{CEGIELSKI:1996:HAL-00096771:1, AUTHOR = {Patrick Cegielski}, JOURNAL = {Quadrature}, TITLE = {C'est é-lé-mentaire}, YEAR = {1996}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {13-17}, VOLUME = {24}, URL = {http://hal.archives-ouvertes.fr/hal-00096771/en/} } @ARTICLE{CEGIELSKI:1996:HAL-00095667:1, AUTHOR = {Patrick Cegielski}, JOURNAL = {Annals of Mathematics and Artificial Intelligence}, TITLE = {Definability, decidability and complexity}, YEAR = {1996}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {311-341}, VOLUME = {111}, URL = {http://hal.archives-ouvertes.fr/hal-00095667/en/} } @ARTICLE{CEGIELSKI:1996:HAL-00095673:1, AUTHOR = {Patrick Cegielski and Yuri Matiyasevich and Denis Richard}, JOURNAL = {The Journal of Symbolic Logic}, TITLE = {Definability and decidability issues in extensions of the integers with the divisibility predicate}, YEAR = {1996}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {515-540}, VOLUME = {61}, URL = {http://hal.archives-ouvertes.fr/hal-00095673/en/} } @ARTICLE{CEGIELSKI:1996:HAL-00097626:1, AUTHOR = {Patrick Cegielski and Jean-Pierre Raoult and Denis Richard}, JOURNAL = {Quadrature}, TITLE = {Colloque National sur les Recherches en IUT}, YEAR = {1996}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {120}, VOLUME = {24}, URL = {http://hal.archives-ouvertes.fr/hal-00097626/en/} } @ARTICLE{DBLP:journals/tcs/DurandR96, AUTHOR = {Arnaud Durand and Solomampionona Ranaivoson}, JOURNAL = {Theor. Comput. Sci.}, TITLE = {First-Order Spectra with one Binary Predicate}, YEAR = {1996}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1&2}, PAGES = {305-320}, VOLUME = {160}, DOI = {10.1016/0304-3975(95)00112-3} } @ARTICLE{DBLP:journals/ipl/Lacoste96, AUTHOR = {Thierry Lacoste}, JOURNAL = {Inf. Process. Lett.}, TITLE = {Finitistic Proofs of 0-1 Laws for Fragments of Second-Order Logic}, YEAR = {1996}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {1-4}, VOLUME = {58}, DOI = {10.1016/0020-0190(96)00035-X} } @ARTICLE{michel96, AUTHOR = {Olivier Michel}, JOURNAL = {Computer Languages}, TITLE = {Design and implementation of 8riptsize1/2, a declarative data-parallel language}, YEAR = {1996}, OPTMONTH = {}, NOTE = {special issue on Parallel Logic Programming}, NUMBER = {2/3}, PAGES = {165--179}, VOLUME = {22}, PUBLISHER = {Elsevier Science Publishers}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/1996/ComputerLanguages.pdf} } @INPROCEEDINGS{pcw96, AUTHOR = {M. Bamha and G. Hains}, BOOKTITLE = {PCW'96, Sixth Parallel Computing Workshop}, TITLE = {Implementing VCODE with Static Processes}, YEAR = {1996}, ADDRESS = {Kawasaki, Japan}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {Extended abstract}, OPTNUMBER = {}, ORGANIZATION = {Fujitsu-Labs, FPCRF}, PAGES = {P1-H-1 to P1-H-4}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{devito96a, AUTHOR = {De Vito, D. and Olivier Michel}, BOOKTITLE = {EuroMicro'96}, TITLE = {Effective SIMD code generation for the high-level declarative data-parallel language 8riptsize 1/2}, YEAR = {1996}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {114--119}, PUBLISHER = {IEEE Computer Society}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{ESM96, AUTHOR = {Jean-Michel Fourneau and Nihal Pekergin and Hind Taleb}, BOOKTITLE = {10th European Simulation MultiConference (ESM 96)}, TITLE = {Stochastic bounds and QoS : an application to the loss rates in ATM networks}, YEAR = {1996}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Society for Computer Simulation International}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{europar96, AUTHOR = {G. Hains and J. Mullins}, BOOKTITLE = {EURO-PAR'96}, TITLE = {Array Structures and Data-Parallel Algorithms}, YEAR = {1996}, ADDRESS = {Lyon}, OPTCROSSREF = {}, EDITOR = { Bougé and Fraigniaud and Mignotte and Robert}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1124}, ORGANIZATION = {LIP-ENSL}, PAGES = {409--416}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, OPTVOLUME = {} } @INPROCEEDINGS{hk-iscis, AUTHOR = {Hanna Klaudel and R.-C. Riemann}, BOOKTITLE = {Eleventh International Symposium on Computer and Information Science}, TITLE = {Consistent Equivalence Notion for a Class of High Level Petri Nets}, YEAR = {1996}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {V. Atalay and U. Halici and K. Inan and N. Yalabik and A. Yazici}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Middle East Technical University}, OPTSERIES = {}, VOLUME = {I} } @INPROCEEDINGS{n.96:_deriv_normal_is_hierar_using_applic_const, AUTHOR = {N. Lammari and R. Laleau and M. Jouve and X. Castellani}, BOOKTITLE = {CAISE'96 (Conference on Advanced Information Systems Engineering)}, TITLE = {Deriving Normalized Is_A Hierarchies by Using Applicability Constraints}, YEAR = {1996}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, OPTVOLUME = {} } @INPROCEEDINGS{n.96:_normal_class_split_inher_hierar, AUTHOR = {N. Lammari and R. Laleau and M. Jouve and X. Castellani}, BOOKTITLE = {Fourth Maghrebian Conference on Software Engineering and Artificial Intelligence (4th MCSEAI)}, TITLE = {Normalizing Classes by Splitting them into Inheritances Hierarchies}, YEAR = {1996}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{LP1996:ICSIS, AUTHOR = {J. Lilius and E. Pelz}, BOOKTITLE = {ICSIS'96}, TITLE = {An M-net semantics for B(PN)$^2$ with procedures}, YEAR = {1996}, ADDRESS = {Antalya}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{michel96z, AUTHOR = {Olivier Michel}, BOOKTITLE = {Euro-Par '96: Proceedings of the Second International Euro-Par Conference on Parallel Processing}, TITLE = {A Straightforward Translation of D0L Systems in the Declarative Data-Parallel Language 8riptsize1/2}, YEAR = {1996}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {714--717}, PUBLISHER = {Springer-Verlag}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/1996/w11.ps.gz} } @INPROCEEDINGS{michel96b, AUTHOR = {Olivier Michel}, BOOKTITLE = {EuroPar'96 Parallel Processing}, TITLE = {Introducing Dynamicity in the Data-Parallel Language 8riptsize1/2}, YEAR = {1996}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Luc Bougé and Pierre Fraigniaud and Anne Mignotte and Yves Robert}, MONTH = {August}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {678--686}, PUBLISHER = {Springer Verlag}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {1123}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/1996/w21.pdf} } @INPROCEEDINGS{michel96e, AUTHOR = {Olivier Michel}, BOOKTITLE = {Journées du GDR Programmation}, TITLE = {Les amalgames : un mécanisme pour la structuration et la construction incrémentielle de programmes déclaratifs}, YEAR = {1996}, ADDRESS = {Orléans}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {20--22 sep}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {GDR Programmation du CNRS}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/1996/gdr96.ps.gz} } @INPROCEEDINGS{michel96a, AUTHOR = {Olivier Michel and De Vito, D. and J.-P. Sansonnet}, BOOKTITLE = {Intensional Programming II:Proc. of the 9th Int. Symp. on Lucid and Intensional Programming}, TITLE = {8riptsize1/2 : data-parallelism and data-flow}, YEAR = {1996}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {E. Ashcroft}, MONTH = {May}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {World Scientific}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/1996/islip96.ps.gz} } @TECHREPORT{TR-LACL-1996-08, AUTHOR = {D. Beauquier and A. Slissenko}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {Polytime model checking for timed probabilistic systems}, YEAR = {1996}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-1996-08}, OPTTYPE = {}, PS = {http://lacl.univ-paris12.fr/Rapports/TR/TR-96-08.ps.gz} } @TECHREPORT{TR-LACL-1996-10, AUTHOR = {D. Beauquier and A. Slissenko}, INSTITUTION = {LACL (Laboratory of Algorithms, Complexity and Logic), University of Paris-Est (Paris 12)}, TITLE = {The railroad crossing problem: Towards semantics of timed algorithms and their model-checking in high-level languages}, YEAR = {1996}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {TR-LACL-1996-10}, OPTTYPE = {}, PS = {http://lacl.univ-paris12.fr/Rapports/TR/TR-96-16.ps.gz} } @MISC{ccpl96, AUTHOR = {G. Hains}, HOWPUBLISHED = {DIMACS Workshop on Computational Complexity and Programming Languages}, MONTH = {July}, NOTE = {Unpublished Contributed Talk. Workshop URL: http://www.cis.syr.edu/people/royer/talks.html}, TITLE = {Explicit Process Locations and Functional Parallel Programming}, YEAR = {1996}, ADDRESS = {Rutgers University, NJ, USA}, URL = {http://www.cis.syr.edu/people/royer/ghains.html#summary} } @MISC{giavitto96d, AUTHOR = {J.-P. Sansonnet and Jean-Louis Giavitto and O. Michel and A. Mahiout and De Vito, D.}, OPTHOWPUBLISHED = {}, MONTH = {January}, OPTNOTE = {}, TITLE = {Rapport d'activité du thème 8riptsize 1/2 -- 8riptsize1/2 : Modèles et outils pour les grandes simulations}, YEAR = {1996} } @UNPUBLISHED{gdrp96, AUTHOR = {G. Hains}, NOTE = {Journées du GDR-Programmation, Pôle programmation fonctionnelle, Orléans, GDRP-CNRS}, TITLE = {L'approche Berry-Curien des Langages Fonctionnels: Application au Parallélisme en Processus Statiques}, OPTMONTH = {}, YEAR = {1996} } @ARTICLE{Beau94d, AUTHOR = {D. Beauquier and P. Aigrain}, JOURNAL = {Theoretical Computer Science}, TITLE = {Polyomino tilings, cellular automata and codicity}, YEAR = {1995}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {165-180}, VOLUME = {147} } @ARTICLE{ipl95, AUTHOR = {G. Utard and G. Hains}, JOURNAL = {Information Processing Letters}, TITLE = {Deadlock-Free Absorption of Barrier Synchronisations}, YEAR = {1995}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {221--227}, VOLUME = {56} } @INPROCEEDINGS{BeauBurSliss:1995:CFMP, AUTHOR = {Danièle Beauquier and D. Burago and Anatol Slissenko}, BOOKTITLE = {Proc. of the 20th Intern. Symp. on Mathematical Foundations of Computer Science (MFCS'95), Lect. Notes in Comput. Sci, vol. 969}, TITLE = {On the Complexity of Finite Memory Policies for Markov Decision Processes}, YEAR = {1995}, ADDRESS = {Prague, Czech Republic}, OPTCROSSREF = {}, EDITOR = {J. Wiedermann and P. Hájek}, MONTH = {August 28 -- September 1, 1995}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {191--200}, PUBLISHER = {Springer-Verlag}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{hk-icpn95, AUTHOR = {E. Best and W. Fraczak and R.P. Hopkins and H. Klaudel and E. Pelz.}, BOOKTITLE = {Fundamentals of Computation Theory}, TITLE = {A Class of Composable High Level Petri Nets}, YEAR = {1995}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {De Michelis, G. and M. Diaz}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer-Verlag}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {1995} } @INPROCEEDINGS{hk-strict2, AUTHOR = {Raymond Devillers and Hanna Klaudel}, BOOKTITLE = {Application and Theory of Petri Nets'95}, TITLE = {Refinement and Recursion in a High Level Petri Box Calculus}, YEAR = {1995}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {J. Desel}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer-Verlag}, SERIES = {Workshops in Computing}, OPTVOLUME = {} } @INPROCEEDINGS{giavitto95, AUTHOR = {Jean-Louis Giavitto and Olivier Michel and J.-P. Sansonnet}, BOOKTITLE = {Parallel Symbolic Languages and Systems (International Workshop PSLS'95)}, TITLE = {Group based fields}, YEAR = {1995}, ADDRESS = {Beaune (France)}, OPTCROSSREF = {}, EDITOR = {I. Takayasu and R. H. Halstead and C. Queinnec}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {209--215}, PUBLISHER = {Springer Verlag}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {1068}, PDF = {http://www.ibisc.fr/~michel/PUBLIS/1995/psls.pdf} } @INPROCEEDINGS{europar95, AUTHOR = {G. Hains and J. Mullins}, BOOKTITLE = {EURO-PAR'95}, TITLE = {A Metacircular Data-Parallel Functional Language (Extended abstract)}, YEAR = {1995}, ADDRESS = {Stockholm}, OPTCROSSREF = {}, EDITOR = { Haridi and Ali and Magnusson}, MONTH = {August}, OPTNOTE = {}, NUMBER = {966}, OPTORGANIZATION = {}, PAGES = {711--714}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, OPTVOLUME = {} } @INPROCEEDINGS{hk-strict1, AUTHOR = {H. Klaudel and E. Pelz}, BOOKTITLE = {Structures in Concurrency Theory '95}, TITLE = {An M-net Semantics of $B(PN)^2$}, YEAR = {1995}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {J. Desel}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer-Verlag}, SERIES = {Workshops in Computing}, OPTVOLUME = {} } @INPROCEEDINGS{hk-fct, AUTHOR = {H. Klaudel and E. Pelz}, BOOKTITLE = {Fundamentals of Computation Theory}, TITLE = {Communication as Unification in the Petri Box Calculus}, YEAR = {1995}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {H. Reichel}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer-Verlag}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {965} } @INPROCEEDINGS{michel95c, AUTHOR = {Olivier Michel and Jean-Louis Giavitto}, BOOKTITLE = {Journées du GDR Programmation}, TITLE = {Typer une collection par la présentation d'un groupe}, YEAR = {1995}, ADDRESS = {Grenoble, 23-24 Novembre 1995}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {GDR Programmation du CNRS}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/1995/gdr95.ps.gz} } @INPROCEEDINGS{DBLP:conf/seke/SchwerKB95, AUTHOR = {Sylviane R. Schwer and Naoufel Kraïem and Joël Brunet}, BOOKTITLE = {SEKE'95, The 7th International Conference on Software Engineering and Knowledge Engineering, June 22-24, 1995, Rockville, Maryland, USA, Proceedings}, TITLE = {The Temporal Dimension of Conceptual Dimension Objects}, YEAR = {1995}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {98-102}, PUBLISHER = {Knowledge Systems Institute}, OPTSERIES = {}, OPTVOLUME = {} } @TECHREPORT{isis95-1E, AUTHOR = {G. Hains and J. Mullins}, INSTITUTION = {ISIS, Fujitsu Labs}, TITLE = {Array Structures and Data-Parallel Algorithms}, YEAR = {1995}, ADDRESS = {Makuhari, Japan}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {RR-95-1E}, TYPE = {Research Note} } @TECHREPORT{michel95a, AUTHOR = {Olivier Michel}, INSTITUTION = {Laboratoire de Recherche en Informatique, UMR 8623 du CNRS}, TITLE = {Design and implementation of 8riptsize1/2, a declarative data-parallel language}, YEAR = {1995}, OPTADDRESS = {}, MONTH = {December}, OPTNOTE = {}, NUMBER = {1012}, OPTTYPE = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/1995/rt-1012.ps.gz} } @UNPUBLISHED{gdrp95, AUTHOR = {G. Hains and J. Mullins}, NOTE = {Journées du GDR-Programmation, Pôle programmation fonctionnelle, Grenoble, GDRP-CNRS}, TITLE = {Une Catégorie Cartésienne Fermée de Structures Réparties}, OPTMONTH = {}, YEAR = {1995} } @UNPUBLISHED{michel95b, AUTHOR = {Olivier Michel}, NOTE = {(personnal memo)}, TITLE = {The 8riptsize1/2 reference manual}, OPTMONTH = {}, YEAR = {1995}, INSTITUTION = {Université de Paris-Sud, Orsay}, NUMBER = {internal report of the 8riptsize1/2 team} } @INCOLLECTION{ecst94, AUTHOR = {G. Hains}, BOOKTITLE = {Encyclopedia of Computer Science and Technology}, PUBLISHER = {M. Dekker inc, New-York}, TITLE = {Programming with Array Structures}, YEAR = {1994}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {A. Kent and J. G. Williams}, OPTMONTH = {}, NOTE = {Appears also in Encyclopedia of Microcomputers}, OPTNUMBER = {}, PAGES = {105--119}, OPTSERIES = {}, OPTTYPE = {}, VOLUME = {14} } @ARTICLE{DBLP:journals/is/BrunetCMS94, AUTHOR = {Joël Brunet and Corine Cauvet and D. Meddahi and Farida Semmak}, JOURNAL = {Inf. Syst.}, TITLE = {Applying object-oriented analysis on a case study}, YEAR = {1994}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {199-209}, VOLUME = {19} } @ARTICLE{FKPQV94, AUTHOR = {Jean-Michel Fourneau and Leila Kloul and Nihal Pekergin and Franck Quesette and Véronique V èque}, JOURNAL = {Annales des Telecoms}, TITLE = {Modelling buffer admission mechanisms using Stochastic Automata Networks.}, YEAR = {1994}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {5-6}, PAGES = {337-349}, VOLUME = {49}, PUBLISHER = {hermes} } @ARTICLE{HeinKricSlisSole:1991:FSPS, AUTHOR = {J. Heintz and T. Krick and Anatol Slissenko and P. Solernó}, JOURNAL = {J. of Math. Sci.}, TITLE = {Finding Shortest Paths around Semi-Algebraic Obstacles in the Plane}, YEAR = {1994}, OPTMONTH = {}, NOTE = {Russian original in: Zapiski Nauchnykh Seminarov LOMI, 192:164-174, 1991.}, NUMBER = {4}, PAGES = {1944--1949}, VOLUME = {70} } @INPROCEEDINGS{DBLP:conf/caise/CauvetS94, AUTHOR = {Corine Cauvet and Farida Semmak}, BOOKTITLE = {Advanced Information Systems Engineering, CAiSE'94, Utrecht, The Netherlands, June 6-10, 1994, Proceedings}, TITLE = {Abstraction Forms in Object-Oriented Conceptual Modeling: Localization, Aggregation and Generalization Extensions}, YEAR = {1994}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Gerard Wijers and Sjaak Brinkkemper and Anthony I. Wasserman}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {149-171}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {811} } @INPROCEEDINGS{PekerginOPPSI, AUTHOR = {Pierre Cubaud and Nihal Pekergin and Hind Taleb}, BOOKTITLE = {European Simulation Symposium (ESS94)}, TITLE = {Oppsi: A performance prediction tool for parallel systems}, YEAR = {1994}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {210--214}, PUBLISHER = {International Society for Computer Simulation}, OPTSERIES = {}, VOLUME = {2} } @INPROCEEDINGS{DBLP:conf/csl/DurandR94, AUTHOR = {Arnaud Durand and Solomampionona Ranaivoson}, BOOKTITLE = {}, TITLE = {Computer Science Logic, 8th International Workshop, CSL '94, Kazimierz, Poland, September 25-30, 1994, Selected Papers}, YEAR = {1994}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Leszek Pacholski and Jerzy Tiuryn}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {177-189}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {933} } @INPROCEEDINGS{jfla94, AUTHOR = {C. Foisy and J. Vachon and G. Hains}, BOOKTITLE = {Journées Francophones des Langages Applicatifs}, TITLE = {DPML: de la Sémantique à l'Implantation}, YEAR = {1994}, ADDRESS = {Noirmoutier}, OPTCROSSREF = {}, EDITOR = {P. Cointe and C. Queinnec and B. Serpette}, MONTH = {Février}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {185--214}, PUBLISHER = {INRIA}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/atmn/FourneauPT94, AUTHOR = {Jean-Michel Fourneau and Nihal Pekergin and H. Taleb}, BOOKTITLE = {Modelling and Evaluation of ATM Networks}, TITLE = {An application of stochastic ordering to the analysis of the push-out mechanism}, YEAR = {1994}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Demetres D. Kouvatsos}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {227-244}, PUBLISHER = {Chapman & Hall}, SERIES = {IFIP Conference Proceedings}, VOLUME = {17} } @INPROCEEDINGS{hk-esda, AUTHOR = {W. Fraczak and Hanna Klaudel}, BOOKTITLE = {Engineering System Design and Analysis'94}, TITLE = {A Multi-action Synchronisation Schema and its Application to the PBC}, YEAR = {1994}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {A.Ertas M.M.Tanik and I.I.Esat}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {American Society of Mechanical Engineers}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{ifip94, AUTHOR = {G. Hains}, BOOKTITLE = {Workshop on General Purpose Parallel Computing. World Computer Congress}, TITLE = {Parallel Functional Languages Should be Strict}, YEAR = {1994}, ADDRESS = {Hamburg}, OPTCROSSREF = {}, EDITOR = {B. Pehrson and I. Simon}, MONTH = {September}, OPTNOTE = {}, OPTNUMBER = {}, ORGANIZATION = {IFIP}, PAGES = {527--532}, PUBLISHER = {North-Holland}, OPTSERIES = {}, VOLUME = {1} } @INPROCEEDINGS{pcw94, AUTHOR = {G. Hains}, BOOKTITLE = {Third Parallel Computing Workshop}, TITLE = {Towards Portable and Efficient Parallel Functional Languages}, YEAR = {1994}, ADDRESS = {Kawasaki, Japan}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {November}, OPTNOTE = {}, OPTNUMBER = {}, ORGANIZATION = {Fujitsu Laboratories}, OPTPAGES = {}, PUBLISHER = {Fujitsu Parallel Computing Research Facilities}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{lammari94:_algor_is_hierar_deriv, AUTHOR = {N. Lammari and R. Laleau and M. Jouve and X. Castellani}, BOOKTITLE = {OOIS'94 (International Conference on Object-Oriented Information systems)}, TITLE = {An Algorithm for IS_A Hierarchy Derivation}, YEAR = {1994}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {469--479}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, OPTVOLUME = {} } @INPROCEEDINGS{lammari94:_autom_proces_based_exist_depen, AUTHOR = {N. Lammari and R. Laleau and M. Jouve and X. Castellani}, BOOKTITLE = {International Conference on Information Systems and Management of Data (CISMOD'94)}, TITLE = {An Automated Process Based on Existence Dependencies for Determining Class Substructures}, YEAR = {1994}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {54--65}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{michel94c, AUTHOR = {Olivier Michel and De Vito, D.}, BOOKTITLE = {Journées du GDR Programmation}, TITLE = {8,5 un environnement de développement pour le langage 8riptsize1/2}, YEAR = {1994}, ADDRESS = {Lille, 22-23 Septembre 1994}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {GDR Programmation du CNRS}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/1994/gdr94.ps.gz} } @INPROCEEDINGS{michel94b, AUTHOR = {Olivier Michel and J.-L. Giavitto}, BOOKTITLE = {post-ICLP'94 workshop W6 on Parallel and Data Parallel Execution of Logic Programs}, TITLE = {Design and Implementation of a Declarative Data-parallel Language}, YEAR = {1994}, ADDRESS = {S. Margherita Liguria, Italy}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Uppsala University, Computing Science Department}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/1994/iclp.data-parallel.2.ps.gz} } @INPROCEEDINGS{michel94, AUTHOR = {Olivier Michel and Jean-Louis Giavitto and J.-P. Sansonnet}, BOOKTITLE = {SMS-TPE'94: Software for Multiprocessors and Supercomputers}, TITLE = {A data-parallel declarative language for the simulation of large dynamical systems and its compilation}, YEAR = {1994}, ADDRESS = {Moscow, 21-23 September}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {103--111}, PUBLISHER = {Office of Naval Research USA & Russian Basic Research Foundation}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/1994/SMS-TPE-moscow.ps.gz} } @TECHREPORT{lip94.tsi, AUTHOR = {G. Hains}, INSTITUTION = {lip}, TITLE = {Programmation fonctionnelle et parallélisme: une approche pragmatique. Parallel functional programming: a pragmatic approach}, YEAR = {1994}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {RR94-22}, TYPE = {Rapport de Recherche} } @TECHREPORT{lip94, AUTHOR = {G. Hains and J. Mullins}, INSTITUTION = {lip}, TITLE = {A Categorical Model of Array Domains}, YEAR = {1994}, OPTADDRESS = {}, MONTH = {December}, OPTNOTE = {}, NUMBER = {RR94-43}, TYPE = {Rapport de Recherche} } @TECHREPORT{lammari94, AUTHOR = {N. Lammari and R. Laleau and M. Jouve and X. Castellani}, INSTITUTION = {CEDRIC (CNAM)}, TITLE = {Dépendances d'existence: définitions formelles et utilisation pour déterminer des liens d'héritages entre classes}, YEAR = {1994}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {575}, OPTTYPE = {} } @INCOLLECTION{HeinKricSlisSol:1993:BICC, AUTHOR = {J. Heintz and T. Krick and Anatol Slissenko and P. Solernó}, BOOKTITLE = {Publications du département de mathématiques de l'Université de Limoges}, PUBLISHER = {Université de Limoges}, TITLE = {Une borne inférieure pour la construction de chemins polygonaux dans ${R}^n$}, YEAR = {1993}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {94--100}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @ARTICLE{COHEN:1993:HAL-00020069:1, AUTHOR = {Joëlle Cohen and Dominique Perrin and Jean-Eric Pin}, JOURNAL = {Journal of Computer and System Sciences (JCSS)}, TITLE = {On the expressive power of temporal logic for finite words}, YEAR = {1993}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {271-294}, VOLUME = {46}, KEYWORDS = {temporal logic, finite semigroups, varieties of semigroups, finite automata}, URL = {http://hal.archives-ouvertes.fr/hal-00020069/en/}, PDF = {http://hal.archives-ouvertes.fr/docs/00/06/06/03/PDF/CohenPerrinPin.pdf}, ABSTRACT = {{W}e study the expressive power of linear propositional temporal logic interpreted on finite sequences or words. {W}e first give a transparent proof of the fact that a formal language is expressible in this logic if and only if its syntactic semigroup is finite and aperiodic. {T}his gives an effective algorithm to decide whether a given rational language is expressible. {O}ur main result states a similar condition for the "restricted" temporal logic ({RTL}), obtained by discarding the until operator. {A} formal language is {RTL}-expressible if and only if its syntactic semigroup is finite and satisfies a certain simple algebraic condition. {T}his leads to a polynomial time algorithm to check whether the formal language accepted by an n-state deterministic automaton is {RTL}-expressible.} } @ARTICLE{cj93, AUTHOR = {G. Hains and L. M. R. Mullin}, JOURNAL = {The Computer Journal}, TITLE = {Parallel Functional Programming with Arrays}, YEAR = {1993}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {3}, PAGES = {238--245}, VOLUME = {36} } @ARTICLE{Slissenko:1993:VRYR, AUTHOR = {Anatol Slissenko}, JOURNAL = {RAIRO, Technique et science informatique}, TITLE = {A View on Recent Years of Research in Theoretical Computer Science in the Former Soviet Union}, YEAR = {1993}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {9--28}, VOLUME = {12} } @ARTICLE{Slissenko:1993:FTS, AUTHOR = {Anatol Slissenko}, JOURNAL = {Theoret. Comput. Sci.}, TITLE = {On Fault Tolerance of Syntax}, YEAR = {1993}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {215--222}, VOLUME = {119} } @INPROCEEDINGS{DBLP:conf/caise/BrunetCMS93, AUTHOR = {Joël Brunet and Corine Cauvet and D. Meddahi and Farida Semmak}, BOOKTITLE = {Advanced Information Systems Engineering, CAiSE'93, Paris, France, June 8-11, 1993, Proceedings}, TITLE = {Object-Oriented Analysis in Practice}, YEAR = {1993}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Colette Rolland and François Bodart and Corine Cauvet}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {293-308}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {685} } @INPROCEEDINGS{DBLP:conf/atmn/FourneauMPV93, AUTHOR = {Jean-Michel Fourneau and H. Maisonniaux and Nihal Pekergin and Véronique Vèque}, BOOKTITLE = {Modelling and Evaluation of ATM Networks, Workshop on Performance of Communication Systems}, TITLE = {Performance Evaluation of Buffer Policies with Stochastic Automata Networks}, YEAR = {1993}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Harry G. Perros and Guy Pujolle and Y. Takahashi}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {433-451}, PUBLISHER = {North-Holland}, SERIES = {IFIP Transactions}, VOLUME = {C-15} } @INPROCEEDINGS{parle93, AUTHOR = {G. Hains and C. Foisy}, BOOKTITLE = {PARLE'93, Parallel Architectures and Languages Europe}, TITLE = {The Data-Parallel Categorical Abstract Machine}, YEAR = {1993}, ADDRESS = {Munich}, OPTCROSSREF = {}, EDITOR = {A. Bode and M. Reeve and G. Wolf}, MONTH = {June}, OPTNOTE = {}, NUMBER = {694}, OPTORGANIZATION = {}, PAGES = {56--67}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, OPTVOLUME = {} } @PROCEEDINGS{atable92, TITLE = {ATABLE-92 Second international workshop on array structures}, YEAR = {1992}, ADDRESS = {Montréal}, EDITOR = {G. Hains and L. M. R. Mullin}, OPTMONTH = {}, NOTE = {Publication no. 841diro}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, BOOKTITLE = {ATABLE-92 Second international workshop on array structures} } @INCOLLECTION{Slissenko:1992:DSMC, AUTHOR = {Anatol Slissenko}, BOOKTITLE = {Methods and Tools of Information Technology in Science and Industry}, PUBLISHER = {Nauka Publ. House, St.-Petersburg}, TITLE = {Diminishing Search by the Method of Context-Free Decomposition}, YEAR = {1992}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {R. Yusupov}, OPTMONTH = {}, NOTE = {(In Russian.)}, OPTNUMBER = {}, PAGES = {7--20}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @ARTICLE{CEGIELSKI:1992:HAL-00095664:1, AUTHOR = {Patrick Cegielski and Denis Richard}, JOURNAL = {Comptes Rendus de l'Academie des Sciences. Serie 1, Mathematique}, TITLE = {Indécidabilité de la théorie des entiers naturels munis d'une énumération des premiers et de la divisibilité}, YEAR = {1992}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {1431-1434}, VOLUME = {315}, URL = {http://hal.archives-ouvertes.fr/hal-00095664/en/} } @ARTICLE{pelz92:_normal_place_trans_nets, AUTHOR = {E. Pelz}, JOURNAL = {RAIRO Informatique théorique et applications}, TITLE = {Normalization of Place/Transition-Nets preserves net behaviour}, YEAR = {1992}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {19--44}, VOLUME = {26} } @INPROCEEDINGS{DBLP:conf/sas/GiavittoSM92, AUTHOR = {Jean-Louis Giavitto and Jean-Paul Sansonnet and Olivier Michel}, BOOKTITLE = {WSA}, TITLE = {Inférer rapidement la géométrie des collections.}, YEAR = {1992}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {185-193}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {}, PS = {http://www.ibisc.fr/~michel/PUBLIS/1992/wsa92.ps.gz} } @INPROCEEDINGS{jfla92, AUTHOR = {G. Hains and O. Biberstein and C. Foisy}, BOOKTITLE = {Secondes Journées Francophones des Langages Applicatifs, JFLA-92}, TITLE = {La Compilation de Fonctions de Tableaux en code MIMD}, YEAR = {1992}, ADDRESS = {Perros-Guirec, France}, OPTCROSSREF = {}, EDITOR = {C. Queinnec}, MONTH = {Février}, NOTE = {Revue Bigre no. 76-77}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {3--20}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{DBLP:conf/seke/KraiemB92, AUTHOR = {Naoufel Kraïem and Joël Brunet}, BOOKTITLE = {SEKE'92, The 4th International Conference on Software Engineering and Knowledge Engineering, June, 15-20 1992, Capri, Italy}, TITLE = {Mapping of Conceptual Specifications into Object-Oriented Programs}, YEAR = {1992}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {624-639}, PUBLISHER = {Knowledge Systems Institute}, OPTSERIES = {}, OPTVOLUME = {}, DOI = {10.1109/SEKE.1992.227907} } @INPROCEEDINGS{pelz92, AUTHOR = {E. Pelz}, BOOKTITLE = {European Joint Conference on System Design (proceedings ASM)}, TITLE = {A problem in system design: from behavioural specification to net models}, YEAR = {1992}, ADDRESS = {Instanbul}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {june}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{pelz92:_posit_formul_specif_semiw_languag, AUTHOR = {E. Pelz}, BOOKTITLE = {CSL'92}, TITLE = {Positive Formulas Specifying Semiword Languages}, YEAR = {1992}, ADDRESS = {San Miniato}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @TECHREPORT{diro92, AUTHOR = {G. Hains and O. Biberstein and C. Foisy}, INSTITUTION = {diro}, TITLE = {An MIMD Compiler for Functional Programs on Arrays}, YEAR = {1992}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {830}, TYPE = {Publication}, URL = {http://web.univ.orleans.fr/~ghains/publications.html} } @MISC{michel92, AUTHOR = {Olivier Michel}, OPTHOWPUBLISHED = {}, OPTMONTH = {}, NOTE = {Rapport de stage du DEA MISI de l'UPMC Paris VI}, TITLE = {Une plateforme logicielle pour l'expérimentation d'algorithmes de simulation parallèle. Application à Time-Warp}, YEAR = {1992}, INSTITUTION = {Laboratoire de Recherche en Informatique, UMR 8623 du CNRS} } @PROCEEDINGS{arrays90.book, TITLE = {Arrays, Functional Languages and Parallel Systems}, YEAR = {1991}, ADDRESS = {Montréal}, EDITOR = {L. Mullin and M. Jenkin and G. Hains and R. Bernecky and G. Gao}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PUBLISHER = {Kluwer}, OPTSERIES = {}, OPTVOLUME = {}, BOOKTITLE = {Arrays, Functional Languages and Parallel Systems} } @ARTICLE{DBLP:journals/ndjfl/Carbone91, AUTHOR = {Alessandra Carbone}, JOURNAL = {Notre Dame Journal of Formal Logic}, TITLE = {Provable Fixed Points in I Delta$_{\mbox{0}}$ + Omega$_{\mbox{1}}$}, YEAR = {1991}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {4}, PAGES = {562-572}, VOLUME = {32} } @ARTICLE{PV91, AUTHOR = {Nihal Pekergin and Jean-Marc Vincent}, JOURNAL = {IEEE Trans. on Software Engineering}, TITLE = {Stochastic bounds on execution times of parallel programs}, YEAR = {1991}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {105-113}, VOLUME = {17}, PUBLISHER = {IEEE Computer Society} } @ARTICLE{Slissenko:1991:MIQK, AUTHOR = {Anatol Slissenko}, JOURNAL = {Information Sciences: An International Journal}, TITLE = {On Measures of Information Quality of Knowledge Processing Systems}, YEAR = {1991}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {389--402}, VOLUME = {57--58} } @INPROCEEDINGS{buchs91:_le_co_opn, AUTHOR = {D. Buchs and J. Flumet and N. Guelfi and E. Pelz and P. Racloz}, BOOKTITLE = {Workshop sur le Parallèlisme}, TITLE = {Le formalisme CO-OPN}, YEAR = {1991}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = { B.Hirsbrunner}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, ORGANIZATION = {Université de Fribourg}, OPTPAGES = {}, OPTPUBLISHER = {}, SERIES = {rapport LIUF}, OPTVOLUME = {} } @INPROCEEDINGS{arrays90, AUTHOR = {G. Hains}, BOOKTITLE = {Arrays, Functional Languages and Parallel Systems}, TITLE = {Matrix Inversion in 3 Dimensions}, YEAR = {1991}, ADDRESS = {Montréal}, CROSSREF = {arrays90.book}, EDITOR = {L. Mullin and M. Jenkin and G. Hains and R. Bernecky and G. Gao}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {295--302}, PUBLISHER = {Kluwer}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{leeds91, AUTHOR = {G. Hains}, BOOKTITLE = {Abstract Machine Models for Highly Parallel Computers}, TITLE = {Multidimensional Arrays as Parallel Data Structure}, YEAR = {1991}, ADDRESS = {University of Leeds, UK}, OPTCROSSREF = {}, OPTEDITOR = {}, MONTH = {March}, OPTNOTE = {}, OPTNUMBER = {}, ORGANIZATION = {British Computer Society Workshop}, PAGES = {41--44}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{Slissenko:1990:TEES, AUTHOR = {Anatol Slissenko}, BOOKTITLE = {Industrial Applications of Artificial Intelligence, Proc. IFIP TC5/WG5.3 International Conference on Artificial Intelligence in CIM}, TITLE = {Technological Environment for Expert Systems Development}, YEAR = {1991}, ADDRESS = {Leningrad, USSR}, OPTCROSSREF = {}, EDITOR = {J. Alty and L. Mikulich}, MONTH = {April 16--18, 1990}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {172--175}, PUBLISHER = {North-Holland}, OPTSERIES = {}, OPTVOLUME = {} } @TECHREPORT{diro91, AUTHOR = {G. Hains and L. M. R. Mullin}, INSTITUTION = {diro}, TITLE = {An Algebra of Multidimensional Arrays}, YEAR = {1991}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {783}, TYPE = {Publication} } @PHDTHESIS{pelz90:_logiq_petri, AUTHOR = {E. Pelz}, SCHOOL = {University of Paris-Sud}, TITLE = {Réseaux et Logique, L'étude des sémantiques de la concurrence dans le cadre des réseaux de Petri}, YEAR = {1990}, OPTADDRESS = {}, OPTMONTH = {}, NOTE = {Thèse d'Etat}, OPTTYPE = {} } @ARTICLE{CEGIELSKI:1990:HAL-00095659:1, AUTHOR = {Patrick Cegielski}, JOURNAL = {Comptes Rendus de l'Academie des Sciences. Serie 1, Mathematique}, TITLE = {La théorie des corps inductifs archimédiens rationnellement complets}, YEAR = {1990}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {847-850}, VOLUME = {311}, URL = {http://hal.archives-ouvertes.fr/hal-00095659/en/} } @ARTICLE{CEGIELSKI:1990:HAL-00095655:1, AUTHOR = {Patrick Cegielski}, JOURNAL = {Comptes rendus de l'académie des sciences, Mathématiques}, TITLE = {La théorie des corps réels-clos inductifs est une extension conservative de l'arithmétique de Peano}, YEAR = {1990}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {239-242}, VOLUME = {310}, URL = {http://hal.archives-ouvertes.fr/hal-00095655/en/} } @ARTICLE{cras90, AUTHOR = {G. Hains}, JOURNAL = {Comptes Rendus de l'Académie des Sciences, Paris}, TITLE = {La Complexité du Filtrage Associatif-Commutatif}, YEAR = {1990}, MONTH = {Novembre}, NOTE = {Comité de Lecture Section Mathématiques}, NUMBER = {11}, PAGES = {741--744}, VOLUME = {t.311, Série I} } @ARTICLE{MatMinOreSli:1990:NAS, AUTHOR = {Yuri Matiyasevich and G. Mints and V. Orevkov and Anatol Slissenko}, JOURNAL = {Russian Math. Surveys}, TITLE = {Nikolai Aleksandrovich Shanin (on his Seventieth Birthday)}, YEAR = {1990}, OPTMONTH = {}, NOTE = {Russian original in: Uspekhi Matem. Nauk, 45(1):205--206, 1990.}, NUMBER = {1}, PAGES = {239--240}, VOLUME = {45} } @ARTICLE{pelz90:_logic, AUTHOR = {E. Pelz}, JOURNAL = {Journal of Information Processing and Cybernetics}, TITLE = {Logic versus sequential and concurrent net behaviour}, YEAR = {1990}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {8-9}, PAGES = {461--472}, VOLUME = {EIK 26} } @INPROCEEDINGS{DBLP:conf/er/BrunetCL90, AUTHOR = {Joël Brunet and Corine Cauvet and Louis Lasoudris}, BOOKTITLE = {Proceedings of the 9th International Conference on Entity-Relationship Approach (ER'90), 8-10 October, 1990, Lausanne, Switzerland}, TITLE = {Why Using Events in a High-Level Specification}, YEAR = {1990}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {Hannu Kangassalo}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {221-233}, PUBLISHER = {ER Institute}, OPTSERIES = {}, OPTVOLUME = {}, URL = {http://dblp.uni-trier.de/db/conf/er/BrunetCL90.html} } @INPROCEEDINGS{pelz90:_normal_place_trans_nets, AUTHOR = {E. Pelz}, BOOKTITLE = {ESPRIT-BRA-DEMON meeting}, TITLE = {Normalization of Place/Transition-Nets preserves net behaviour}, YEAR = {1990}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{pelz90:_place_trans, AUTHOR = {E. Pelz}, BOOKTITLE = {Journées PRC Informatique et Mathématiques}, TITLE = {Place/Transition-systems: Concurrent Behaviour and logic}, YEAR = {1990}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, ORGANIZATION = {Univ. Montpellier}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @TECHREPORT{diro90, AUTHOR = {G. Hains}, INSTITUTION = {diro}, TITLE = {Sequential and Parallel Complexity of Associative-Commutative Matching}, YEAR = {1990}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {718}, TYPE = {Publication} } @PHDTHESIS{DPhil, AUTHOR = {G. Hains}, SCHOOL = {Oxford University}, TITLE = {Parallel Algorithms for Free and Associative-Commutative Unification}, YEAR = {1989}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, TYPE = {D.Phil. thesis} } @INCOLLECTION{GoroLebeSlis:1989:ESM, AUTHOR = {V. Gorodetsky and A. Lebedev and Anatol Slissenko}, BOOKTITLE = {Special Purpose Expert Systems}, PUBLISHER = {USSR Ministry of Defense, Moscow}, TITLE = {Expert Systems in Modeling}, YEAR = {1989}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {Series: Fundamental and Perspective Research in the Interests of the Defense. (In Russian.)}, OPTNUMBER = {}, OPTPAGES = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @INCOLLECTION{GoroLebeSlis:1989:DSMC, AUTHOR = {V. Gorodetsky and A. Lebedev and Anatol Slissenko}, BOOKTITLE = {Special Purpose Expert Systems}, PUBLISHER = {USSR Ministry of Defense, Moscow}, TITLE = {Man-Machine Interface as a Tool of Increasing the Productivity of Design and Aplication of Computer Systems of Knowledge Processing}, YEAR = {1989}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {Series: Fundamental and Perspective Research in the Interests of the Defense. (In Russian.)}, OPTNUMBER = {}, OPTPAGES = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @INCOLLECTION{GoroLebeSlis:1989:PCDS, AUTHOR = {V. Gorodetsky and A. Lebedev and Anatol Slissenko}, BOOKTITLE = {Special Purpose Expert Systems}, PUBLISHER = {USSR Ministry of Defense, Moscow}, TITLE = {Problems of Complexity and Design of Special Purpose Expert Systems}, YEAR = {1989}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {Series: Fundamental and Perspective Research in the Interests of the Defense. (In Russian.)}, OPTNUMBER = {}, OPTPAGES = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @INCOLLECTION{Slissenko:1989:PALA, AUTHOR = {Anatol Slissenko}, BOOKTITLE = {Theoretical Aspects and Tools of Applied Intellectual Systems}, PUBLISHER = {Scientific Council for Cybernetics of the Acad. Sci. of the USSR, Moscow}, TITLE = {Towards the Problem of Analysis of Logical and Algorithmical Structure of the Systems of Knowledge Representation and Processing}, YEAR = {1989}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {Series: Questions of Cybernetics. (In Russian.)}, OPTNUMBER = {}, OPTPAGES = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @ARTICLE{CEGIELSKI:1989:HAL-00095651:1, AUTHOR = {Patrick Cegielski}, JOURNAL = {Notre Dame Journal of Formal Logic}, TITLE = {The Elementary Theory of the Natural Lattice is Finitely Axiomatizable}, YEAR = {1989}, OPTMONTH = {}, NOTE = {Accessible en ligne dans le cadre du projet Euclide http://projecteuclid.org/Dienst/UI/1.0/Summarize/euclid.ndjfl/1093635001}, OPTNUMBER = {}, PAGES = {138-150}, VOLUME = {30}, URL = {http://hal.archives-ouvertes.fr/hal-00095651/en/} } @INPROCEEDINGS{acfas89, AUTHOR = {G. Hains}, BOOKTITLE = {Parallélisme: modèles et complexité}, TITLE = {Mémoires partagées et réseaux systoliques: algorithmes élégants et/ou efficaces}, YEAR = {1989}, ADDRESS = {Laboratoire de Combinatoire et d'Informatique Mathématique, Université du Québec à Montréal}, OPTCROSSREF = {}, EDITOR = {S. Brlek}, MONTH = {Juin}, NOTE = {Colloque au $57^{\mbox{i\`eme}}$ congrès de l'ACFAS, Montréal}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INPROCEEDINGS{parle89, AUTHOR = {G. Hains}, BOOKTITLE = {PARLE '89, Parallel Architectures and Languages Europe}, TITLE = {The Compaction of Acyclic Terms}, YEAR = {1989}, ADDRESS = {Eindhoven, The Netherlands}, OPTCROSSREF = {}, EDITOR = {E. Odijk and M. Rem and J.-C. Syre}, MONTH = {June}, OPTNOTE = {}, NUMBER = {365 and 366}, OPTORGANIZATION = {}, PAGES = {288-303}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, OPTVOLUME = {} } @INPROCEEDINGS{pelz89:_about_en, AUTHOR = {E. Pelz}, BOOKTITLE = {Advances in Petri nets}, TITLE = {About the concurrent behaviour of EN systems: definability and closure results}, YEAR = {1989}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {G. Rozenberg}, OPTMONTH = {}, NOTE = {Selected articles from the 9th Europ. Workshop on Application and Theory of Petri nets}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {354--373}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {424} } @INPROCEEDINGS{ics88, AUTHOR = {G. Hains and B. S. Todd}, BOOKTITLE = {Third International Conference on Supercomputing ICS88}, TITLE = {The Parallel Implementation of a Medical Diagnostic Model}, YEAR = {1988}, ADDRESS = {Boston, Mass.}, OPTCROSSREF = {}, EDITOR = {L. P. Kartashev and S. I. Kartashev}, OPTMONTH = {}, NOTE = {3 volumes.}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {222-229}, PUBLISHER = {International Supercomputing Institute}, OPTSERIES = {}, VOLUME = {I} } @INPROCEEDINGS{pelz88:_compor, AUTHOR = {E. Pelz}, BOOKTITLE = {journées AFCET-IIE sur les réseaux de Petri}, TITLE = {Comportements concurrents des réseaux élémentaires: définissabilité et propriétés de clôture}, YEAR = {1988}, ADDRESS = {Evry}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, ORGANIZATION = {IIE}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @UNPUBLISHED{pelz88:_about_en, AUTHOR = {E. Pelz}, NOTE = {In 9th Europ. Workshop on Application and Theory of Petri nets}, TITLE = {About the concurrent behaviour of EN systems: definability and closure results}, OPTMONTH = {}, YEAR = {1988} } @BOOK{berline87:_logic, PUBLISHER = {North-Holland}, TITLE = {Logic Colloquium'85}, YEAR = {1987}, ALTAUTHOR = {}, EDITOR = {C. Berline and E. Bouscaren and M. Dickmann and J.-L. Krivine and D. Lascar and M. Parigot and E. Pelz and G. Sabbagh}, OPTADDRESS = {}, OPTEDITION = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTSERIES = {}, OPTVOLUME = {} } @INCOLLECTION{CEGIELSKI:1987:HAL-00096775:1, AUTHOR = {Patrick Cegielski}, BOOKTITLE = {Fragments d'histoire des mathématiques II}, PUBLISHER = {APMEP (Association des Professeurs de Mathématiques de l'Enseignement Public)}, TITLE = {Historique de la théorie élémentaire des ensembles}, YEAR = {1987}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {161-210}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00096775/en/} } @ARTICLE{CEGIELSKI:1987:HAL-00097607:1, AUTHOR = {Patrick Cegielski and Leszek Pacholski and Denis Richard and Jerzy Tomasik and Alex Wilkie}, JOURNAL = {Annals of Pure and Applied Logic}, TITLE = {Preface - Logic Colloquium '94, 21-30 July 1994, Clermont-Ferrand, France}, YEAR = {1987}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {1-3}, VOLUME = {89}, URL = {http://hal.archives-ouvertes.fr/hal-00097607/en/} } @INPROCEEDINGS{pelz87:_closur_petri, AUTHOR = {E. Pelz}, BOOKTITLE = {STACS'87}, TITLE = {Closure properties of deterministic Petri net languages}, YEAR = {1987}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {247} } @INPROCEEDINGS{pelz87:_infin_petri, AUTHOR = {E. Pelz}, BOOKTITLE = {Advances in Petri nets}, TITLE = {Infinitary languages of Petri nets and logical sentences}, YEAR = {1987}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {G. Rozenberg}, OPTMONTH = {}, NOTE = {Selected articles from the 7th Europ. Workshop on Application and Theory of Petri nets}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {224--237}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {266} } @INPROCEEDINGS{pelz87:_logic, AUTHOR = {E. Pelz}, BOOKTITLE = {6th Symposium on Computation theory}, TITLE = {Logic versus sequential and concurrent net behaviour}, YEAR = {1987}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, OPTORGANIZATION = {}, OPTPAGES = {}, PUBLISHER = {Wendisch-Rietz}, OPTSERIES = {}, OPTVOLUME = {} } @MASTERSTHESIS{MSc, AUTHOR = {G. Hains}, SCHOOL = {Oxford University}, TITLE = {Distributed Algorithms for Restricted Unification}, YEAR = {1987}, ADDRESS = {Programming Research Group}, OPTMONTH = {}, OPTNOTE = {}, TYPE = {MSc dissertation} } @INPROCEEDINGS{parigot86:_petri, AUTHOR = {M. Parigot and E. Pelz}, BOOKTITLE = {Advances in Petri nets}, TITLE = {A logical formalism for the study of the finite behaviour of Petri nets}, YEAR = {1986}, OPTADDRESS = {}, OPTCROSSREF = {}, EDITOR = {G. Rozenberg}, OPTMONTH = {}, NOTE = {Selected articles from the 6th Europ. Workshop on Application and Theory of Petri nets}, OPTNUMBER = {}, OPTORGANIZATION = {}, PAGES = {346--361}, PUBLISHER = {Springer-Verlag}, SERIES = {LNCS}, VOLUME = {222} } @UNPUBLISHED{pelz86:_petri, AUTHOR = {E. Pelz}, NOTE = {In 7th Europ. Workshop on Application and Theory of Petri nets}, TITLE = {omega-languages of Petri nets and logical sentences}, OPTMONTH = {}, YEAR = {1986} } @ARTICLE{LavrSlisTsei:1985:CISP, AUTHOR = {S. Lavrov and Anatol Slissenko and G. Tseitin}, JOURNAL = {Microprocessor Devices and Systems}, TITLE = {Curriculum for Informatics and System Programming. Project.}, YEAR = {1985}, OPTMONTH = {}, NOTE = {(In Russian.)}, OPTNUMBER = {}, PAGES = {20--28}, VOLUME = {4} } @ARTICLE{parigot85:_petri, AUTHOR = {M. Parigot and E. Pelz}, JOURNAL = {Theoretical Computer Science}, TITLE = {A logical approach of Petri net languages}, YEAR = {1985}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {155--169}, VOLUME = {39} } @ARTICLE{pelz85:_les_fried_muchn, AUTHOR = {E. Pelz}, JOURNAL = {Seminaire de Logique 1982-1983}, TITLE = {Les débuts de la méthode de priorité et les théorèmes de Friedberg-Muchnick}, YEAR = {1985}, OPTMONTH = {}, NOTE = {F. Delon, D. Lascar, A. Louveau, G. Sabbagh editeurs, Publ. MAth. de l'Univ. Paris VII, Collection Astérisques}, OPTNUMBER = {}, PAGES = {45-64}, VOLUME = {19} } @ARTICLE{pelz85, AUTHOR = {E. Pelz}, JOURNAL = {Theoretical Computer Science}, TITLE = {On the complexity of theories of permutations}, YEAR = {1985}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {247--269}, VOLUME = {41} } @INPROCEEDINGS{pelz85:_petri, AUTHOR = {E. Pelz and G. Vidal-Naquet}, BOOKTITLE = {Journées Informatique et Mathématiques}, TITLE = {Réseaux de Petri: modélisation, langages, extensions}, YEAR = {1985}, OPTADDRESS = {}, OPTCROSSREF = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, ORGANIZATION = {Univ. Caen}, OPTPAGES = {}, OPTPUBLISHER = {}, OPTSERIES = {}, OPTVOLUME = {} } @UNPUBLISHED{parigot85:_petri, AUTHOR = {M. Parigot and E. Pelz}, NOTE = {In 6th Europ. Workshop on Application and Theory of Petri nets}, TITLE = {A logical charactéeisation of Petri net languages}, OPTMONTH = {}, YEAR = {1985} } @INCOLLECTION{Slissenko:1984:LCDE, AUTHOR = {Anatol Slissenko}, BOOKTITLE = {Proc. Intern. Congress of Mathematicians, August 16--24, 1983, Waszawa}, PUBLISHER = {ICM, Waszawa}, TITLE = {Linguistic Considerations in Devising Effective Algorithms}, YEAR = {1984}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {347--357}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @ARTICLE{CEGIELSKI:1984:HAL-00095646:1, AUTHOR = {Patrick Cegielski}, JOURNAL = {Comptes rendus de l'académie des sciences, Mathématiques}, TITLE = {La théorie élémentaire de la divisibilité est finiment axiomatisable}, YEAR = {1984}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {367-369}, VOLUME = {299}, KEYWORDS = {Treillis des entiers naturels}, URL = {http://hal.archives-ouvertes.fr/hal-00095646/en/} } @ARTICLE{DaMaMiOrShSl:1984:SYS, AUTHOR = {G. Davydov and Yuri Matiyasevich and G. Mints and V. Orevkov and N. Shanin and Anatol Slissenko}, JOURNAL = {Uspekhi Matem. Nauk}, TITLE = {Sergei Yuryevich Maslov. Obituary}, YEAR = {1984}, OPTMONTH = {}, NOTE = {(In Russian.)}, OPTNUMBER = {}, PAGES = {239--240}, VOLUME = {39} } @TECHREPORT{yorktown84, AUTHOR = {G. Hains}, INSTITUTION = {Concordia University, Department of Mathematics}, TITLE = {An Interactive Language for Symbolic Mathematics}, YEAR = {1984}, OPTADDRESS = {}, OPTMONTH = {}, NOTE = {Describes Scratchpad Computer Algebra System}, OPTNUMBER = {}, TYPE = {Work Term Report} } @INCOLLECTION{DaMaMiOrSl:1969:CADDeng, AUTHOR = {G. Davydov and S. Maslov and G. Mints and V. Orevkov and Anatol Slissenko}, BOOKTITLE = {The Automation of Reasoning 2. Classical Papers on Computational Logic 1967--1970}, PUBLISHER = {Springer-Verlag}, TITLE = {A Computer Algorithm for the Determination of Deducibility on the Basis of the Inverse Method}, YEAR = {1983}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {J. Siekmann and G. Wrightson}, OPTMONTH = {}, NOTE = {Russian original in: Zapiski Nauchnykh Seminarov LOMI, 16:8--19, 1969.}, OPTNUMBER = {}, PAGES = {531--541}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @INCOLLECTION{OrlovSliss:1983:AIIP, AUTHOR = {G. Orlovsky and Anatol Slissenko}, BOOKTITLE = {Computers in Design and Manifacturing}, PUBLISHER = {Mashinostroyeniye Publ. House}, TITLE = {Artificial Intelligence: an Industrial Point of View}, YEAR = {1983}, ADDRESS = {Leningrad}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTEDITOR = {}, OPTMONTH = {}, NOTE = {(In Russian.)}, OPTNUMBER = {}, OPTPAGES = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @INCOLLECTION{ShDaMaMiOrSl:1983:AMSN, AUTHOR = {N. Shanin and G. Davydov and S. Maslov and G. Mints and V. Orevkov and Anatol Slissenko}, BOOKTITLE = {The Automation of Reasoning I. Classical Papers on Computational Logic 1957--1966}, PUBLISHER = {Springer-Verlag}, TITLE = {An Algorithm for Machine Search of a Natural Logical Deduction in a Propositional Calculus}, YEAR = {1983}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {J. Siekmann and G. Wrightson}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {424-483}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @INCOLLECTION{ShDaMaMiOrSl:1983:CADD, AUTHOR = {N. Shanin and G. Davydov and S. Maslov and G. Mints and V. Orevkov and Anatol Slissenko}, BOOKTITLE = {The Automation of Reasoning 1. Classical Papers on Computational Logic 1957--1966}, PUBLISHER = {Springer-Verlag}, TITLE = {An algorithm for a machine search of a natural logical deduction in a propositional calculus}, YEAR = {1983}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {Siekmann. J. and G. Wrightson}, OPTMONTH = {}, NOTE = {Russian was published by ``'Nauka'' in 1965 as a booklet.}, OPTNUMBER = {}, OPTPAGES = {}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @ARTICLE{amq83, AUTHOR = {G. Hains}, JOURNAL = {Bulletin de l'Association Mathématique du Québec}, TITLE = {Groupe Symétrique et Tableaux de Young. Remarques sur l'Algorithme Générateur}, YEAR = {1983}, MONTH = {Octobre}, OPTNOTE = {}, OPTNUMBER = {}, OPTPAGES = {}, OPTVOLUME = {} } @ARTICLE{Slissenko:1981:DPSM, AUTHOR = {Anatol Slissenko}, JOURNAL = {J. of Soviet Mathmatics}, TITLE = {Detection of Periodicities and String-Matching in Real Time}, YEAR = {1983}, OPTMONTH = {}, NOTE = {Russian original in: Zapiski Nauchnykh Seminarov LOMI, 105:62--173, 1981.}, NUMBER = {3}, PAGES = {1316--1386}, VOLUME = {22} } @PHDTHESIS{pelz82, AUTHOR = {E. Pelz}, SCHOOL = {University of Paris 7}, TITLE = {Complexité algorithmique de la théorie de deux bijections qui commutent}, YEAR = {1982}, OPTADDRESS = {}, OPTMONTH = {}, OPTNOTE = {}, OPTTYPE = {} } @INCOLLECTION{CEGIELSKI:1982:HAL-00096748:1, AUTHOR = {Patrick Cegielski and Mc Aloon, Kenneth and George Wilmers}, BOOKTITLE = {Logic colloquium 80}, PUBLISHER = {North-Holland}, TITLE = {Modèles récursivement saturés de l'addition et de la multiplication des entiers naturels}, YEAR = {1982}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {van Dalen, D.}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {57-68}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {}, URL = {http://hal.archives-ouvertes.fr/hal-00096748/en/} } @ARTICLE{Slissenko:1982:CFGT, AUTHOR = {Anatol Slissenko}, JOURNAL = {Inform. Process. Lett.}, TITLE = {Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems}, YEAR = {1982}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {2}, PAGES = {52--56}, VOLUME = {14} } @INCOLLECTION{AdelsSliss:1981:WCWD, AUTHOR = {G. Adel'son-Vel'ski and Anatol Slissenko}, BOOKTITLE = {Proc. Intern. Symp. on Algorithms in Modern Mathematics and Computer Science, September 16--22, 1979, Lect. Notes Comput. Sci., vol. 122}, PUBLISHER = {Springer-Verlag}, TITLE = {What Can We Do with Problems of Exhaustive Search?}, YEAR = {1981}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, EDITOR = {A. Ershov and D. Knuth}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {315--342}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @ARTICLE{CEGIELSKI:1981:HAL-00096746:1, AUTHOR = {Patrick Cegielski}, JOURNAL = {Lecture Notes in Mathematics}, TITLE = {La théorie élémentaire de la multiplication}, YEAR = {1981}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {44-89}, VOLUME = {890}, KEYWORDS = {Arithmétique de Skolem}, URL = {http://hal.archives-ouvertes.fr/hal-00096746/en/} } @ARTICLE{CEGIELSKI:1981:HAL-00095642:1, AUTHOR = {Patrick Cegielski}, JOURNAL = {Comptes rendus de l'académie des sciences, Mathématiques}, TITLE = {La théorie élémentaire de la multiplication est conséquence d'un nombre fini d'axiomes de ISigmaZéro}, YEAR = {1981}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {351-352}, VOLUME = {293}, KEYWORDS = {Arithmétique de Skolem}, URL = {http://hal.archives-ouvertes.fr/hal-00095642/en/} } @ARTICLE{Slissenko:1981:SPRT, AUTHOR = {Anatol Slissenko}, JOURNAL = {J. of Soviet Mathematics}, TITLE = {A Simplified Proof of Real-Time Recognizability of Palindromes on Turing Machines}, YEAR = {1981}, OPTMONTH = {}, NOTE = {Russian original in: Zapiski Nauchnykh Seminarov LOMI, 68:123--139, 1977.}, NUMBER = {1}, PAGES = {68--77}, VOLUME = {15} } @ARTICLE{Slissenko:1981:CPTC, AUTHOR = {Anatol Slissenko}, JOURNAL = {Russian Mathematical Surveys}, TITLE = {Complexity Problems of Theory of Computation}, YEAR = {1981}, OPTMONTH = {}, NOTE = {Russian original in: Uspekhi Matem. Nauk, 36(2):21--103, 1981.}, NUMBER = {6}, PAGES = {23--125}, VOLUME = {36} } @ARTICLE{CEGIELSKI:1980:HAL-00095636:1, AUTHOR = {Patrick Cegielski}, JOURNAL = {Comptes rendus de l'académie des sciences, Mathématiques}, TITLE = {La théorie élémentaire de la multiplication}, YEAR = {1980}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {935-938}, VOLUME = {290}, KEYWORDS = {Arithmétique de Skolem}, URL = {http://hal.archives-ouvertes.fr/hal-00095636/en/} } @ARTICLE{MasMatMinOreSli:1980:NAS, AUTHOR = {S. Maslov and Yuri Matiyasevich and G. Mints and V. Orevkov and Anatol Slissenko}, JOURNAL = {Uspekhi Matem. Nauk}, TITLE = {Nikolai Aleksandrovich Shanin (on his Sixtieth Anniversary)}, YEAR = {1980}, OPTMONTH = {}, NOTE = {(In Russian.)}, NUMBER = {2(212)}, PAGES = {241--245}, VOLUME = {35} } @ARTICLE{Slissenko:1980:FRTA, AUTHOR = {Anatol Slissenko}, JOURNAL = {Soviet Mathematical Doklady}, TITLE = {Finding in Real Time of All the Periodicities in a Word}, YEAR = {1980}, OPTMONTH = {}, NOTE = {Russian original in Doklady Akademii Nauk SSSR}, NUMBER = {2}, PAGES = {392--295}, VOLUME = {21} } @INCOLLECTION{Slissenko:1979:WCWD, AUTHOR = {Anatol Slissenko}, BOOKTITLE = {Proc. Intern. Symp. on Mathematical Foundations of Computer Science (MFCS'79), Lect. Notes Comput. Sci., vol. 74}, PUBLISHER = {Springer-Verlag}, TITLE = {Computational Complexity of String and Graph Identification}, YEAR = {1979}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {182--190}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @INCOLLECTION{Slissenko:1978:MCBA, AUTHOR = {Anatol Slissenko}, BOOKTITLE = {Proc. Soviet Symp. on AI and Automation of Research in Mathematics, Kiev}, PUBLISHER = {Institute of Cybernetics, Kiev}, TITLE = {Models of Computations Based on Address Organization of Storage}, YEAR = {1978}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {94--96}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @INCOLLECTION{Slissenko:1978:SMRT, AUTHOR = {Anatol Slissenko}, BOOKTITLE = {Proc. Intern. Symp. on Mathematical Foundations of Computer Science (MFCS'78), Lect. Notes Comput. Sci., vol. 64}, PUBLISHER = {Springer-Verlag}, TITLE = {String-Matching in Real-Time: Some Properties of the Data Structure}, YEAR = {1978}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {493--496}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @ARTICLE{Slissenko:1978:FAPO, AUTHOR = {Anatol Slissenko}, JOURNAL = {J. of Soviet Mathematics}, TITLE = {Finite Approach to the Problem of Optimizing Theorem-Proving Algorithms}, YEAR = {1978}, OPTMONTH = {}, NOTE = {Russian original in: Zapiski Nauchnykh Seminarov LOMI, 49:123-130, 1975.}, NUMBER = {4}, PAGES = {597--603}, VOLUME = {10} } @ARTICLE{Slissenko:1976:RSPM, AUTHOR = {Anatol Slissenko}, JOURNAL = {Proc. Steklov Inst. of Mathematics}, TITLE = {Recognizing a Symmetry Predicate by Multihead Turing Machines with Input}, YEAR = {1976}, OPTMONTH = {}, NOTE = {Russian original in: Trudy Matematicheskogo Instituta Akademii Nauk SSSR, 129:30--202, 1973.}, OPTNUMBER = {}, PAGES = {25--208}, VOLUME = {129} } @ARTICLE{Slissenko:1973:PESC, AUTHOR = {Anatol Slissenko}, JOURNAL = {J. of Soviet Mathematics}, TITLE = {A Property of Enumerable Sets Containing 'Complexly Deducible' Formulas}, YEAR = {1973}, OPTMONTH = {}, NOTE = {Russian original in: Zapiski Nauchnykh Seminarov LOMI, 20:200-207, 1971.}, NUMBER = {1}, PAGES = {126--131}, VOLUME = {1} } @ARTICLE{Slissenko:1970:SQAM, AUTHOR = {Anatol Slissenko}, JOURNAL = {Proc. Steklov Inst. of Mathematics}, TITLE = {Some Questions of Approximation of Maximal Continuity Regulators}, YEAR = {1970}, OPTMONTH = {}, NOTE = {Russian original in: Trudy Matematicheskogo Instituta Akademii Nauk SSSR, 113:73--78, 1970.}, OPTNUMBER = {}, OPTPAGES = {}, VOLUME = {113} } @ARTICLE{DaMaMiOrSl:1969:CADD, AUTHOR = {N. Shanin and G. Davydov and S. Maslov and G. Mints and V. Orevkov and Anatol Slissenko}, JOURNAL = {Zapiski Nauchnykh Seminarov LOMI}, TITLE = {A Computer Algorithm for the Determination of Deducibility on the Basis of the Inverse Method}, YEAR = {1969}, OPTMONTH = {}, NOTE = {In Russian.}, OPTNUMBER = {}, PAGES = {8--19}, VOLUME = {16} } @ARTICLE{Slissenko:1967:AOCS, AUTHOR = {Anatol Slissenko}, JOURNAL = {Proc. Steklov Inst. of Mathematics}, TITLE = {Arithmetical Operations on Certain Sets of Duplexes}, YEAR = {1967}, OPTMONTH = {}, NOTE = {Russian original in: Trudy Matematicheskogo Instituta Akademii Nauk SSSR, 93:187--207, 1967.}, OPTNUMBER = {}, PAGES = {241--267}, VOLUME = {93} } @ARTICLE{Slissenko:1967:MCRC, AUTHOR = {Anatol Slissenko}, JOURNAL = {Zapiski Nauchnykh Seminarov LOMI}, TITLE = {On Maximal Continuity Regulators of Constructive Functions}, YEAR = {1967}, OPTMONTH = {}, NOTE = {In Russian. Translated into English in: Seminars in Mathematics, V.A.Steklov Mathematical Institute, Leningrad, Consultants Bureau, New York, 4:82--84, 1969.}, OPTNUMBER = {}, PAGES = {201--208}, VOLUME = {4} } @ARTICLE{Slissenko:1967:CMCR, AUTHOR = {Anatol Slissenko}, JOURNAL = {Proc. Steklov Inst. of Mathematics}, TITLE = {The Construction of Maximal Continuity Regulators for Constructive Functions}, YEAR = {1967}, OPTMONTH = {}, NOTE = {Russian original in: Trudy Matematicheskogo Instituta Akademii Nauk SSSR, 93:208-249, 1967.}, OPTNUMBER = {}, PAGES = {269--317}, VOLUME = {93} } @INCOLLECTION{Slissenko:1966:SAPR, AUTHOR = {Anatol Slissenko}, BOOKTITLE = {Inter. Congres of Mathematicians, Moscow, 1966. Section 1, Mathematical Logic and Foundations of Mathematics. Abstracts}, PUBLISHER = {ICM, Moscow}, TITLE = {Some Algorithmic Problems Related to Computational Mathematics}, YEAR = {1966}, OPTADDRESS = {}, OPTCHAPTER = {}, OPTCROSSREF = {}, OPTEDITION = {}, OPTEDITOR = {}, OPTMONTH = {}, OPTNOTE = {}, OPTNUMBER = {}, PAGES = {24--25}, OPTSERIES = {}, OPTTYPE = {}, OPTVOLUME = {} } @BOOK{ShDaMaMiOrSl:1965:AMSN, PUBLISHER = {Nauka, Leningrad}, TITLE = {An Algorithm for Machine Search of a Natural Logical Deduction in a Propositional Calculus}, YEAR = {1965}, AUTHOR = {N. Shanin and G. Davydov and S. Maslov and G. Mints and V. Orevkov and Anatol Slissenko}, ALTEDITOR = {}, OPTADDRESS = {}, OPTEDITION = {}, OPTMONTH = {}, NOTE = {39p.}, OPTNUMBER = {}, OPTSERIES = {}, OPTVOLUME = {} } @ARTICLE{Slissenko:1964:ENDC, AUTHOR = {Anatol Slissenko}, JOURNAL = {Proc. Steklov Inst. of Mathematics}, TITLE = {An Example of Non-Discontinuous but not Continuous Constructive Operator in a Metric Space}, YEAR = {1964}, OPTMONTH = {}, NOTE = {Russian original in Trudy Matematicheskogo Instituta Akademii Nauk SSSR}, OPTNUMBER = {}, OPTPAGES = {}, VOLUME = {72} } @ARTICLE{Slissenko:1964:CNSS, AUTHOR = {Anatol Slissenko}, JOURNAL = {Proc. Steklov Inst. of Mathematics}, TITLE = {On Constructive Non-Separable Spaces}, YEAR = {1964}, OPTMONTH = {}, NOTE = {Russian original in Trudy Matematicheskogo Instituta Akademii Nauk SSSR}, OPTNUMBER = {}, OPTPAGES = {}, VOLUME = {72} } @ARTICLE{Slissenko:1964:SAPC, AUTHOR = {Anatol Slissenko}, JOURNAL = {Proc. Steklov Inst. of Mathematics}, TITLE = {On Some Algorithmic Problems, Concerning Arithmetical Operations on Duplexes}, YEAR = {1964}, OPTMONTH = {}, NOTE = {Russian original in Trudy Matematicheskogo Instituta Akademii Nauk SSSR}, OPTNUMBER = {}, OPTPAGES = {}, VOLUME = {72} } @ARTICLE{Slissenko:1963:SPAO, AUTHOR = {Anatol Slissenko}, JOURNAL = {Soviet Mathematical Doklady}, TITLE = {On Some Algorithmic Problems, Concerning Arithmetical Operations on Duplexes}, YEAR = {1963}, OPTMONTH = {}, NOTE = {Russian original in Doklady Akademii Nauk SSSR}, NUMBER = {2}, OPTPAGES = {}, VOLUME = {152} }