http://rise4fun.com/List of tools available on RiSE4funen-USrise4fun © 2013 Microsoft Corporationhttp://rise4fun.com//Images/Rise.gifhttp://rise4fun.com/http://rise4fun.com/AglAgl is built on the principle of the Sugiyama scheme; it produces so called layered, or hierarchical layouts. This kind of a layout naturally applies to graphs with some flow of information.http://rise4fun.com/BekWith BEK, you can answer questions like Do these two programs output the same string? Can this program ever output a target string? What happens if I compose these two programs? Does the order matter? More general than regular expressions, BEK has been specifically tailored to capture common idioms in string manipulating functions.http://rise4fun.com/BoogieBoogie is an intermediate verification language, intended as a layer on which to build program verifiers for other languages.http://rise4fun.com/ChaliceChalice is a simple imperative programming language with constructs for thread creation, locking, and channels. The language has built-in specification constructs, and specifications are written in the style of implicit dynamic frames with fractional permissions.http://rise4fun.com/CodeContractsCode Contracts provide a language-agnostic solution to the problem of software specification and validation. They consist of an API (part of .NET) to author contracts, and several tools consuming it (e.g., code documentation, runtime checking, and static checking). The static checker, based on abstract interpretation, infers semantic facts and uses them to prove contracts, programmer-provided and language assertions. Furthermore, it helps the development process by providing verified code repairs.http://rise4fun.com/CounterdogCounterdog is an automated theorem-prover for a counterfactual meta-logic about propositional Datalog programs. It is useful, for example, for reasoning about Datalog-based trust management and authorization languages.http://rise4fun.com/DafnyDafny is an imperative, object-oriented programming language with classes and datatypes, and specification constructs for describing intended behavior. The Dafny verifier checks that programs live up to their specifications.http://rise4fun.com/DKALDKAL is a logic-based distributed authorization policy language. Originally it was aimed for authorization policies, but in fact it is appropriate for policies in general. In DKAL world, principals have their own states and compute their own knowledge. DKAL facilitates the analysis of policies. Are the given policies consistent? Do they comply with various regulations? Is privacy protected? And so on.http://rise4fun.com/EsmEsm focus on understanding various software development issues from an empirical perspective. We are involved in doing practical studies on large software systems.http://rise4fun.com/FastWith FAST, you can answer questions like Can this program ever output a target tree? What happens if I compose these two programs?http://rise4fun.com/FormulaFORMULA is a modern formal specification language targeting model-based development (MBD). It is based on algebraic data types (ADTs) and strongly-typed constraint logic programming (CLP), which support concise specifications of abstractions and model transformations. Around this core is a set of composition operators for composing specifications in the style of MBD.http://rise4fun.com/FStarF* is a new ML-like programming language. It also works as a general-purpose verification tool for higher-order stateful programs. It is based on (and subsumes) two prior projects from MSR: Fine and F7.http://rise4fun.com/HeapDbgAbstraction and visualization of heapshttp://rise4fun.com/iZ3iZ3 is a high-performance interpolating theorem prover. iZ3 supports arithmetic, arrays, uninterpreted functions, and quantifiers.http://rise4fun.com/KokaKoka is a function-oriented programming language that separates pure values from side-effecting computations. Koka has many features that help programmers to easily change their data types and code organization correctly, while having a small language core with a familiar JavaScript like syntax.http://rise4fun.com/QuickCodeA progamming-by-example technology for learning string transformation programs. Part of this technology will ship as part of the Flash Fill feature in Excel in Office 2013. http://rise4fun.com/RevisionsRevisions provides programmers with a simple, yet powerful and efficient mechanism to execute various application tasks in parallel even if those tasks access the same data and may exhibit read-write or write-write conflicts. Revisions is based on mutable snapshots and deterministic conflict resolution.http://rise4fun.com/RexRex turns regular expressions into Symbolic Automatons and applies state of art technique to generate members.http://rise4fun.com/SealA static analysis that determines the side-effects of a methodhttp://rise4fun.com/SLAyerSLAyer is an automatic, separation-logic-based memory safety checker. It checks that its input C code doesn't deference dangling pointers, do double frees, nor leak memory.http://rise4fun.com/SpecSharpSpec# is a formal language for API contracts (influenced by JML, AsmL, and Eiffel), which extends C# with constructs for non-null types, preconditions, postconditions, and object invariants. Spec# comes with a sound programming methodology that permits specification and reasoning about object invariants even in the presence of callbacks and multi-threading.http://rise4fun.com/VccVCC is a tool that proves correctness of annotated concurrent C programs or finds problems in them. VCC extends C with design by contract features, like pre- and postcondition as well as type invariants. Annotated programs are translated to logical formulas using the Boogie tool, which passes them to an automated SMT solver Z3 to check their validity.http://rise4fun.com/VcppWith the Visual C++ compiler (and Standard Library) you can compile your code snippet with various versions of the compiler. You will see the compilation output with errors and /W4 warnings.http://rise4fun.com/VeriFastVeriFast is a separation logic-based program verifier for C and Java programs.http://rise4fun.com/Z3Z3 is a high-performance theorem prover. Z3 supports arithmetic, fixed-size bit-vectors, extensional arrays, datatypes, uninterpreted functions, and quantifiers.http://rise4fun.com/Z34BiologyZ3-4Bio provides a unified semantic framework based on transition systems which allows translations from a range of formalisms and tools for modeling biological systems to SMT encodings usable within the Z3 solver. With Z3-4Bio, a set biological questions that are hard to study using simulation can be asked, and models can be analyzed formally against rich temporal specifications.http://rise4fun.com/Z3PyZ3 is a high-performance theorem prover. Z3 supports arithmetic, fixed-size bit-vectors, extensional arrays, datatypes, uninterpreted functions, and quantifiers.http://rise4fun.com/Z3RCFPackage for computing with algebraic, transcendental and infinitesimal extensions. For optimal performance, download the source code, and build Z3 using GMP (see instructions at http://z3.codeplex.com/wikipage?title=CADE24).